./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db03244f437c604118fe4e6b7fad5fed51908f88ca97b14f50d7801b4370610e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:49:45,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:49:45,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:49:45,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:49:45,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:49:45,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:49:45,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:49:45,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:49:45,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:49:45,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:49:45,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:49:45,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:49:45,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:49:45,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:49:45,756 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:49:45,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:49:45,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:49:45,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:49:45,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:49:45,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:49:45,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:49:45,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:49:45,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:49:45,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:49:45,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:49:45,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:49:45,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:49:45,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:49:45,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:49:45,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:49:45,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:49:45,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:49:45,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:49:45,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:49:45,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:49:45,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:49:45,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:49:45,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db03244f437c604118fe4e6b7fad5fed51908f88ca97b14f50d7801b4370610e [2024-10-11 03:49:45,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:49:45,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:49:45,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:49:45,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:49:45,997 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:49:45,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-11 03:49:47,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:49:47,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:49:47,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-11 03:49:47,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1f377afc/689bafd11fe04cd291ce12440dc604c5/FLAGac6cc1aa6 [2024-10-11 03:49:47,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1f377afc/689bafd11fe04cd291ce12440dc604c5 [2024-10-11 03:49:47,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:49:47,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:49:47,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:49:47,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:49:47,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:49:47,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:49:47" (1/1) ... [2024-10-11 03:49:47,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540c1fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:47, skipping insertion in model container [2024-10-11 03:49:47,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:49:47" (1/1) ... [2024-10-11 03:49:47,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:49:48,056 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9243,9256] [2024-10-11 03:49:48,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:49:48,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:49:48,173 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9243,9256] [2024-10-11 03:49:48,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:49:48,209 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:49:48,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48 WrapperNode [2024-10-11 03:49:48,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:49:48,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:49:48,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:49:48,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:49:48,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,269 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 811 [2024-10-11 03:49:48,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:49:48,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:49:48,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:49:48,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:49:48,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:49:48,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:49:48,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:49:48,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:49:48,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:49:48,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (1/1) ... [2024-10-11 03:49:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:49:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:49:48,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:49:48,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:49:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:49:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:49:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:49:48,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:49:48,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:49:48,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:49:49,113 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-11 03:49:49,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:49:49,148 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:49:49,149 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:49:49,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:49:49 BoogieIcfgContainer [2024-10-11 03:49:49,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:49:49,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:49:49,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:49:49,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:49:49,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:49:47" (1/3) ... [2024-10-11 03:49:49,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed85836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:49:49, skipping insertion in model container [2024-10-11 03:49:49,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:49:48" (2/3) ... [2024-10-11 03:49:49,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed85836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:49:49, skipping insertion in model container [2024-10-11 03:49:49,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:49:49" (3/3) ... [2024-10-11 03:49:49,161 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-11 03:49:49,173 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:49:49,173 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:49:49,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:49:49,237 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41a88a1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:49:49,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:49:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 174 states have (on average 1.7701149425287357) internal successors, (308), 175 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:49:49,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:49,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:49,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -233591372, now seen corresponding path program 1 times [2024-10-11 03:49:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892701363] [2024-10-11 03:49:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892701363] [2024-10-11 03:49:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892701363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:49,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438504319] [2024-10-11 03:49:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:49,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:49,899 INFO L87 Difference]: Start difference. First operand has 176 states, 174 states have (on average 1.7701149425287357) internal successors, (308), 175 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:50,348 INFO L93 Difference]: Finished difference Result 1133 states and 1829 transitions. [2024-10-11 03:49:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:49:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-11 03:49:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:50,371 INFO L225 Difference]: With dead ends: 1133 [2024-10-11 03:49:50,371 INFO L226 Difference]: Without dead ends: 1036 [2024-10-11 03:49:50,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:49:50,379 INFO L432 NwaCegarLoop]: 703 mSDtfsCounter, 2021 mSDsluCounter, 3008 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 3711 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:50,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 3711 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:49:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-10-11 03:49:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 269. [2024-10-11 03:49:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4514925373134329) internal successors, (389), 268 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 389 transitions. [2024-10-11 03:49:50,441 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 389 transitions. Word has length 90 [2024-10-11 03:49:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:50,441 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 389 transitions. [2024-10-11 03:49:50,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 389 transitions. [2024-10-11 03:49:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:50,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:50,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:49:50,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1132626435, now seen corresponding path program 1 times [2024-10-11 03:49:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620465176] [2024-10-11 03:49:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620465176] [2024-10-11 03:49:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620465176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314759966] [2024-10-11 03:49:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:50,740 INFO L87 Difference]: Start difference. First operand 269 states and 389 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:50,967 INFO L93 Difference]: Finished difference Result 1235 states and 1910 transitions. [2024-10-11 03:49:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:50,971 INFO L225 Difference]: With dead ends: 1235 [2024-10-11 03:49:50,971 INFO L226 Difference]: Without dead ends: 1095 [2024-10-11 03:49:50,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:50,974 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 1351 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:50,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2391 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-10-11 03:49:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 428. [2024-10-11 03:49:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.5011709601873535) internal successors, (641), 427 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 641 transitions. [2024-10-11 03:49:50,998 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 641 transitions. Word has length 92 [2024-10-11 03:49:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:50,998 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 641 transitions. [2024-10-11 03:49:50,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 641 transitions. [2024-10-11 03:49:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:51,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:51,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:51,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:49:51,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:51,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1185794289, now seen corresponding path program 1 times [2024-10-11 03:49:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300083287] [2024-10-11 03:49:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:51,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300083287] [2024-10-11 03:49:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300083287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:51,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5111644] [2024-10-11 03:49:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:51,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:51,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:51,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:51,237 INFO L87 Difference]: Start difference. First operand 428 states and 641 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:51,432 INFO L93 Difference]: Finished difference Result 1389 states and 2154 transitions. [2024-10-11 03:49:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:51,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:51,440 INFO L225 Difference]: With dead ends: 1389 [2024-10-11 03:49:51,440 INFO L226 Difference]: Without dead ends: 1249 [2024-10-11 03:49:51,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:51,442 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 1557 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:51,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1991 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-11 03:49:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 651. [2024-10-11 03:49:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.5292307692307692) internal successors, (994), 650 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 994 transitions. [2024-10-11 03:49:51,487 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 994 transitions. Word has length 92 [2024-10-11 03:49:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:51,487 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 994 transitions. [2024-10-11 03:49:51,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 994 transitions. [2024-10-11 03:49:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:51,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:51,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:49:51,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1344346019, now seen corresponding path program 1 times [2024-10-11 03:49:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819135584] [2024-10-11 03:49:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819135584] [2024-10-11 03:49:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819135584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563308243] [2024-10-11 03:49:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:51,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:51,688 INFO L87 Difference]: Start difference. First operand 651 states and 994 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:51,860 INFO L93 Difference]: Finished difference Result 1538 states and 2390 transitions. [2024-10-11 03:49:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:51,865 INFO L225 Difference]: With dead ends: 1538 [2024-10-11 03:49:51,866 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 03:49:51,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:51,870 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1757 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:51,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 1932 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 03:49:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2024-10-11 03:49:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.5390428211586902) internal successors, (1222), 794 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1222 transitions. [2024-10-11 03:49:51,891 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1222 transitions. Word has length 92 [2024-10-11 03:49:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:51,892 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1222 transitions. [2024-10-11 03:49:51,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1222 transitions. [2024-10-11 03:49:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:51,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:51,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:49:51,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1002852571, now seen corresponding path program 1 times [2024-10-11 03:49:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614594245] [2024-10-11 03:49:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614594245] [2024-10-11 03:49:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614594245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713219500] [2024-10-11 03:49:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:52,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:52,056 INFO L87 Difference]: Start difference. First operand 795 states and 1222 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:52,240 INFO L93 Difference]: Finished difference Result 1677 states and 2610 transitions. [2024-10-11 03:49:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:52,246 INFO L225 Difference]: With dead ends: 1677 [2024-10-11 03:49:52,246 INFO L226 Difference]: Without dead ends: 1537 [2024-10-11 03:49:52,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:52,248 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1862 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:52,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 1820 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2024-10-11 03:49:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 934. [2024-10-11 03:49:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.5455519828510182) internal successors, (1442), 933 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1442 transitions. [2024-10-11 03:49:52,269 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1442 transitions. Word has length 92 [2024-10-11 03:49:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:52,271 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1442 transitions. [2024-10-11 03:49:52,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1442 transitions. [2024-10-11 03:49:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:52,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:52,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:52,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:49:52,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash 97640856, now seen corresponding path program 1 times [2024-10-11 03:49:52,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784517858] [2024-10-11 03:49:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784517858] [2024-10-11 03:49:52,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784517858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:49:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400034760] [2024-10-11 03:49:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:49:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:49:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:49:52,334 INFO L87 Difference]: Start difference. First operand 934 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:52,372 INFO L93 Difference]: Finished difference Result 1697 states and 2649 transitions. [2024-10-11 03:49:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:49:52,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:52,375 INFO L225 Difference]: With dead ends: 1697 [2024-10-11 03:49:52,377 INFO L226 Difference]: Without dead ends: 936 [2024-10-11 03:49:52,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:49:52,379 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 124 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:52,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 438 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:49:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-11 03:49:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 934. [2024-10-11 03:49:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.5391211146838157) internal successors, (1436), 933 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1436 transitions. [2024-10-11 03:49:52,400 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1436 transitions. Word has length 92 [2024-10-11 03:49:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:52,400 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1436 transitions. [2024-10-11 03:49:52,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1436 transitions. [2024-10-11 03:49:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:52,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:52,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:52,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:49:52,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash -145483495, now seen corresponding path program 1 times [2024-10-11 03:49:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846484724] [2024-10-11 03:49:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846484724] [2024-10-11 03:49:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846484724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:49:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806162343] [2024-10-11 03:49:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:49:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:49:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:49:52,463 INFO L87 Difference]: Start difference. First operand 934 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:52,489 INFO L93 Difference]: Finished difference Result 2385 states and 3717 transitions. [2024-10-11 03:49:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:49:52,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:52,494 INFO L225 Difference]: With dead ends: 2385 [2024-10-11 03:49:52,494 INFO L226 Difference]: Without dead ends: 1624 [2024-10-11 03:49:52,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:49:52,496 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 99 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:52,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 560 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:49:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-11 03:49:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2024-10-11 03:49:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 1.5385564466378778) internal successors, (2494), 1621 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2494 transitions. [2024-10-11 03:49:52,546 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2494 transitions. Word has length 92 [2024-10-11 03:49:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:52,547 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2494 transitions. [2024-10-11 03:49:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2494 transitions. [2024-10-11 03:49:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:52,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:52,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:49:52,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1672667247, now seen corresponding path program 1 times [2024-10-11 03:49:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299135054] [2024-10-11 03:49:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299135054] [2024-10-11 03:49:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299135054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374967277] [2024-10-11 03:49:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:52,719 INFO L87 Difference]: Start difference. First operand 1622 states and 2494 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:52,893 INFO L93 Difference]: Finished difference Result 3259 states and 5042 transitions. [2024-10-11 03:49:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:52,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:52,902 INFO L225 Difference]: With dead ends: 3259 [2024-10-11 03:49:52,902 INFO L226 Difference]: Without dead ends: 2994 [2024-10-11 03:49:52,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:52,905 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1630 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:52,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 2498 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-10-11 03:49:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1896. [2024-10-11 03:49:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 1.541424802110818) internal successors, (2921), 1895 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2921 transitions. [2024-10-11 03:49:52,950 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2921 transitions. Word has length 92 [2024-10-11 03:49:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2921 transitions. [2024-10-11 03:49:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2921 transitions. [2024-10-11 03:49:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:49:52,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:52,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:49:52,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -853842821, now seen corresponding path program 1 times [2024-10-11 03:49:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356795686] [2024-10-11 03:49:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356795686] [2024-10-11 03:49:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356795686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121677680] [2024-10-11 03:49:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:53,122 INFO L87 Difference]: Start difference. First operand 1896 states and 2921 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:53,303 INFO L93 Difference]: Finished difference Result 3543 states and 5485 transitions. [2024-10-11 03:49:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:49:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:49:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:53,313 INFO L225 Difference]: With dead ends: 3543 [2024-10-11 03:49:53,314 INFO L226 Difference]: Without dead ends: 3278 [2024-10-11 03:49:53,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:49:53,316 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1743 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1743 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:53,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1743 Valid, 2282 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2024-10-11 03:49:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2180. [2024-10-11 03:49:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5438274437815511) internal successors, (3364), 2179 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3364 transitions. [2024-10-11 03:49:53,355 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3364 transitions. Word has length 92 [2024-10-11 03:49:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:53,356 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3364 transitions. [2024-10-11 03:49:53,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3364 transitions. [2024-10-11 03:49:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:49:53,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:53,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:53,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:49:53,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:53,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1270009986, now seen corresponding path program 1 times [2024-10-11 03:49:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595427284] [2024-10-11 03:49:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:53,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:53,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595427284] [2024-10-11 03:49:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595427284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:53,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:53,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:53,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883854105] [2024-10-11 03:49:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:53,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:53,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:53,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:53,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:53,459 INFO L87 Difference]: Start difference. First operand 2180 states and 3364 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:53,588 INFO L93 Difference]: Finished difference Result 4298 states and 6661 transitions. [2024-10-11 03:49:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-11 03:49:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:53,594 INFO L225 Difference]: With dead ends: 4298 [2024-10-11 03:49:53,594 INFO L226 Difference]: Without dead ends: 2180 [2024-10-11 03:49:53,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:53,598 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 615 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:53,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 161 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-11 03:49:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-11 03:49:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5296007342817806) internal successors, (3333), 2179 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3333 transitions. [2024-10-11 03:49:53,634 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3333 transitions. Word has length 93 [2024-10-11 03:49:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:53,634 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3333 transitions. [2024-10-11 03:49:53,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3333 transitions. [2024-10-11 03:49:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:49:53,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:53,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:53,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:49:53,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:53,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:53,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2126995803, now seen corresponding path program 1 times [2024-10-11 03:49:53,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:53,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897371545] [2024-10-11 03:49:53,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:53,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897371545] [2024-10-11 03:49:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897371545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397542092] [2024-10-11 03:49:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:53,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:53,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:53,743 INFO L87 Difference]: Start difference. First operand 2180 states and 3333 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:53,858 INFO L93 Difference]: Finished difference Result 4306 states and 6609 transitions. [2024-10-11 03:49:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:49:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:53,864 INFO L225 Difference]: With dead ends: 4306 [2024-10-11 03:49:53,864 INFO L226 Difference]: Without dead ends: 2180 [2024-10-11 03:49:53,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:53,867 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 631 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:53,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 145 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-11 03:49:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-11 03:49:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.51537402478201) internal successors, (3302), 2179 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3302 transitions. [2024-10-11 03:49:53,897 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3302 transitions. Word has length 94 [2024-10-11 03:49:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3302 transitions. [2024-10-11 03:49:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3302 transitions. [2024-10-11 03:49:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:49:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:53,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:53,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:49:53,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 550446878, now seen corresponding path program 1 times [2024-10-11 03:49:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490965622] [2024-10-11 03:49:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490965622] [2024-10-11 03:49:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490965622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:54,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:54,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072719082] [2024-10-11 03:49:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:54,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:54,007 INFO L87 Difference]: Start difference. First operand 2180 states and 3302 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:54,122 INFO L93 Difference]: Finished difference Result 4302 states and 6543 transitions. [2024-10-11 03:49:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-11 03:49:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:54,128 INFO L225 Difference]: With dead ends: 4302 [2024-10-11 03:49:54,129 INFO L226 Difference]: Without dead ends: 2180 [2024-10-11 03:49:54,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:54,133 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 613 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:54,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 153 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-11 03:49:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-11 03:49:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5011473152822397) internal successors, (3271), 2179 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3271 transitions. [2024-10-11 03:49:54,165 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3271 transitions. Word has length 95 [2024-10-11 03:49:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:54,166 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3271 transitions. [2024-10-11 03:49:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3271 transitions. [2024-10-11 03:49:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:49:54,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:54,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:49:54,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1145685073, now seen corresponding path program 1 times [2024-10-11 03:49:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:54,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308303244] [2024-10-11 03:49:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308303244] [2024-10-11 03:49:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308303244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690075345] [2024-10-11 03:49:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:54,260 INFO L87 Difference]: Start difference. First operand 2180 states and 3271 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:54,371 INFO L93 Difference]: Finished difference Result 4310 states and 6490 transitions. [2024-10-11 03:49:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:49:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:54,377 INFO L225 Difference]: With dead ends: 4310 [2024-10-11 03:49:54,381 INFO L226 Difference]: Without dead ends: 2180 [2024-10-11 03:49:54,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:54,385 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 630 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:54,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 137 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2024-10-11 03:49:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2024-10-11 03:49:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.486920605782469) internal successors, (3240), 2179 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3240 transitions. [2024-10-11 03:49:54,419 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3240 transitions. Word has length 96 [2024-10-11 03:49:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:54,419 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3240 transitions. [2024-10-11 03:49:54,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3240 transitions. [2024-10-11 03:49:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:49:54,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:54,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:49:54,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:54,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1098581414, now seen corresponding path program 1 times [2024-10-11 03:49:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851981448] [2024-10-11 03:49:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851981448] [2024-10-11 03:49:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851981448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878148828] [2024-10-11 03:49:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:54,545 INFO L87 Difference]: Start difference. First operand 2180 states and 3240 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:54,732 INFO L93 Difference]: Finished difference Result 6386 states and 9542 transitions. [2024-10-11 03:49:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:54,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-11 03:49:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:54,741 INFO L225 Difference]: With dead ends: 6386 [2024-10-11 03:49:54,741 INFO L226 Difference]: Without dead ends: 4252 [2024-10-11 03:49:54,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:54,746 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 931 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:54,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 209 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:49:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2024-10-11 03:49:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 4250. [2024-10-11 03:49:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.4867027535890798) internal successors, (6317), 4249 states have internal predecessors, (6317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6317 transitions. [2024-10-11 03:49:54,799 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6317 transitions. Word has length 97 [2024-10-11 03:49:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:54,800 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6317 transitions. [2024-10-11 03:49:54,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6317 transitions. [2024-10-11 03:49:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:49:54,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:54,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:54,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:49:54,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:54,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1361975037, now seen corresponding path program 1 times [2024-10-11 03:49:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:54,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11246181] [2024-10-11 03:49:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11246181] [2024-10-11 03:49:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11246181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:54,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:49:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099405345] [2024-10-11 03:49:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:54,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:49:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:54,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:49:54,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:49:54,906 INFO L87 Difference]: Start difference. First operand 4250 states and 6317 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:55,019 INFO L93 Difference]: Finished difference Result 8434 states and 12567 transitions. [2024-10-11 03:49:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:49:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:49:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:55,026 INFO L225 Difference]: With dead ends: 8434 [2024-10-11 03:49:55,026 INFO L226 Difference]: Without dead ends: 4250 [2024-10-11 03:49:55,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:49:55,031 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 572 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:55,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 169 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:49:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2024-10-11 03:49:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 4250. [2024-10-11 03:49:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.472346434455166) internal successors, (6256), 4249 states have internal predecessors, (6256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6256 transitions. [2024-10-11 03:49:55,107 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6256 transitions. Word has length 98 [2024-10-11 03:49:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6256 transitions. [2024-10-11 03:49:55,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6256 transitions. [2024-10-11 03:49:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:49:55,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:55,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:49:55,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash -10321918, now seen corresponding path program 1 times [2024-10-11 03:49:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349513402] [2024-10-11 03:49:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:55,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349513402] [2024-10-11 03:49:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349513402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:55,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:55,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:49:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746586506] [2024-10-11 03:49:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:55,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:49:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:49:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:49:55,551 INFO L87 Difference]: Start difference. First operand 4250 states and 6256 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:56,126 INFO L93 Difference]: Finished difference Result 12567 states and 18492 transitions. [2024-10-11 03:49:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:49:56,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:49:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:56,138 INFO L225 Difference]: With dead ends: 12567 [2024-10-11 03:49:56,138 INFO L226 Difference]: Without dead ends: 8476 [2024-10-11 03:49:56,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:49:56,147 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 734 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:56,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 679 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:49:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2024-10-11 03:49:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 4250. [2024-10-11 03:49:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.4709343374911743) internal successors, (6250), 4249 states have internal predecessors, (6250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6250 transitions. [2024-10-11 03:49:56,220 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6250 transitions. Word has length 99 [2024-10-11 03:49:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:56,220 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6250 transitions. [2024-10-11 03:49:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6250 transitions. [2024-10-11 03:49:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:49:56,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:56,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:49:56,222 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2114849894, now seen corresponding path program 1 times [2024-10-11 03:49:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615843379] [2024-10-11 03:49:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:56,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615843379] [2024-10-11 03:49:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615843379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:49:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645533669] [2024-10-11 03:49:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:56,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:49:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:49:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:49:56,487 INFO L87 Difference]: Start difference. First operand 4250 states and 6250 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:56,821 INFO L93 Difference]: Finished difference Result 12256 states and 18062 transitions. [2024-10-11 03:49:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:49:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:49:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:56,835 INFO L225 Difference]: With dead ends: 12256 [2024-10-11 03:49:56,835 INFO L226 Difference]: Without dead ends: 8211 [2024-10-11 03:49:56,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:49:56,841 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 511 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:56,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 544 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:49:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8211 states. [2024-10-11 03:49:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8211 to 4250. [2024-10-11 03:49:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.470698987997176) internal successors, (6249), 4249 states have internal predecessors, (6249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6249 transitions. [2024-10-11 03:49:56,943 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6249 transitions. Word has length 100 [2024-10-11 03:49:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:56,944 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6249 transitions. [2024-10-11 03:49:56,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6249 transitions. [2024-10-11 03:49:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:49:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:56,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:56,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:49:56,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 148641810, now seen corresponding path program 1 times [2024-10-11 03:49:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:56,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320038305] [2024-10-11 03:49:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320038305] [2024-10-11 03:49:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320038305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:57,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724407693] [2024-10-11 03:49:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:49:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:57,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:49:57,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:49:57,232 INFO L87 Difference]: Start difference. First operand 4250 states and 6249 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:57,748 INFO L93 Difference]: Finished difference Result 8998 states and 13214 transitions. [2024-10-11 03:49:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:49:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:49:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:57,755 INFO L225 Difference]: With dead ends: 8998 [2024-10-11 03:49:57,755 INFO L226 Difference]: Without dead ends: 4892 [2024-10-11 03:49:57,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:49:57,759 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 704 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:57,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 978 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:49:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2024-10-11 03:49:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4250. [2024-10-11 03:49:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.46999293951518) internal successors, (6246), 4249 states have internal predecessors, (6246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6246 transitions. [2024-10-11 03:49:57,807 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6246 transitions. Word has length 100 [2024-10-11 03:49:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:57,807 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6246 transitions. [2024-10-11 03:49:57,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6246 transitions. [2024-10-11 03:49:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:49:57,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:57,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:49:57,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 771411561, now seen corresponding path program 1 times [2024-10-11 03:49:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212310915] [2024-10-11 03:49:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212310915] [2024-10-11 03:49:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212310915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040906712] [2024-10-11 03:49:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:58,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:49:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:58,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:49:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:49:58,099 INFO L87 Difference]: Start difference. First operand 4250 states and 6246 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:58,655 INFO L93 Difference]: Finished difference Result 12522 states and 18410 transitions. [2024-10-11 03:49:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:49:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:49:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:58,665 INFO L225 Difference]: With dead ends: 12522 [2024-10-11 03:49:58,666 INFO L226 Difference]: Without dead ends: 8461 [2024-10-11 03:49:58,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:49:58,671 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 685 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:58,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 940 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:49:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8461 states. [2024-10-11 03:49:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8461 to 4250. [2024-10-11 03:49:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.4678747940691927) internal successors, (6237), 4249 states have internal predecessors, (6237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6237 transitions. [2024-10-11 03:49:58,771 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6237 transitions. Word has length 101 [2024-10-11 03:49:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:58,771 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6237 transitions. [2024-10-11 03:49:58,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6237 transitions. [2024-10-11 03:49:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 03:49:58,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:58,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:58,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:49:58,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:58,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1778010692, now seen corresponding path program 1 times [2024-10-11 03:49:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986465229] [2024-10-11 03:49:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:49:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:49:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:49:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986465229] [2024-10-11 03:49:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986465229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:49:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:49:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:49:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330415655] [2024-10-11 03:49:59,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:49:59,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:49:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:49:59,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:49:59,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:49:59,060 INFO L87 Difference]: Start difference. First operand 4250 states and 6237 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:49:59,515 INFO L93 Difference]: Finished difference Result 12447 states and 18281 transitions. [2024-10-11 03:49:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:49:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-11 03:49:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:49:59,525 INFO L225 Difference]: With dead ends: 12447 [2024-10-11 03:49:59,526 INFO L226 Difference]: Without dead ends: 8431 [2024-10-11 03:49:59,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:49:59,531 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 868 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:49:59,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 673 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:49:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2024-10-11 03:49:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 4250. [2024-10-11 03:49:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.4652859496352082) internal successors, (6226), 4249 states have internal predecessors, (6226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6226 transitions. [2024-10-11 03:49:59,611 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6226 transitions. Word has length 102 [2024-10-11 03:49:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:49:59,611 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6226 transitions. [2024-10-11 03:49:59,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:49:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6226 transitions. [2024-10-11 03:49:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 03:49:59,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:49:59,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:49:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:49:59,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:49:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:49:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1414105549, now seen corresponding path program 1 times [2024-10-11 03:49:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:49:59,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522264182] [2024-10-11 03:49:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:49:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:49:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:00,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522264182] [2024-10-11 03:50:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522264182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:00,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37547844] [2024-10-11 03:50:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:00,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:00,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:00,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:00,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:00,029 INFO L87 Difference]: Start difference. First operand 4250 states and 6226 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:00,822 INFO L93 Difference]: Finished difference Result 22529 states and 32768 transitions. [2024-10-11 03:50:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:50:00,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-11 03:50:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:00,844 INFO L225 Difference]: With dead ends: 22529 [2024-10-11 03:50:00,845 INFO L226 Difference]: Without dead ends: 18568 [2024-10-11 03:50:00,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:50:00,855 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 2619 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:00,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 696 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:50:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18568 states. [2024-10-11 03:50:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18568 to 4283. [2024-10-11 03:50:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 4282 states have (on average 1.461233068659505) internal successors, (6257), 4282 states have internal predecessors, (6257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 6257 transitions. [2024-10-11 03:50:01,015 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 6257 transitions. Word has length 103 [2024-10-11 03:50:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 6257 transitions. [2024-10-11 03:50:01,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 6257 transitions. [2024-10-11 03:50:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:01,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:01,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:50:01,017 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:01,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1471930391, now seen corresponding path program 1 times [2024-10-11 03:50:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542610006] [2024-10-11 03:50:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542610006] [2024-10-11 03:50:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542610006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:50:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79661554] [2024-10-11 03:50:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:50:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:50:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:50:01,270 INFO L87 Difference]: Start difference. First operand 4283 states and 6257 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:01,799 INFO L93 Difference]: Finished difference Result 12351 states and 18101 transitions. [2024-10-11 03:50:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:01,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:01,808 INFO L225 Difference]: With dead ends: 12351 [2024-10-11 03:50:01,808 INFO L226 Difference]: Without dead ends: 8392 [2024-10-11 03:50:01,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:50:01,812 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 660 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:01,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 902 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:50:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8392 states. [2024-10-11 03:50:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8392 to 4250. [2024-10-11 03:50:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 1.4622264062132266) internal successors, (6213), 4249 states have internal predecessors, (6213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6213 transitions. [2024-10-11 03:50:01,866 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6213 transitions. Word has length 104 [2024-10-11 03:50:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:01,866 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6213 transitions. [2024-10-11 03:50:01,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6213 transitions. [2024-10-11 03:50:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:01,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:01,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:01,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:50:01,868 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:01,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash 298326739, now seen corresponding path program 1 times [2024-10-11 03:50:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267626491] [2024-10-11 03:50:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267626491] [2024-10-11 03:50:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267626491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:50:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113835875] [2024-10-11 03:50:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:02,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:50:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:50:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:02,453 INFO L87 Difference]: Start difference. First operand 4250 states and 6213 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:03,012 INFO L93 Difference]: Finished difference Result 5870 states and 8597 transitions. [2024-10-11 03:50:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:50:03,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:03,016 INFO L225 Difference]: With dead ends: 5870 [2024-10-11 03:50:03,016 INFO L226 Difference]: Without dead ends: 4737 [2024-10-11 03:50:03,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:03,017 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 996 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:03,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 2103 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2024-10-11 03:50:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4198. [2024-10-11 03:50:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4197 states have (on average 1.4624731951393852) internal successors, (6138), 4197 states have internal predecessors, (6138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 6138 transitions. [2024-10-11 03:50:03,049 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 6138 transitions. Word has length 104 [2024-10-11 03:50:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:03,050 INFO L471 AbstractCegarLoop]: Abstraction has 4198 states and 6138 transitions. [2024-10-11 03:50:03,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 6138 transitions. [2024-10-11 03:50:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:03,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:03,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:03,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:50:03,051 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:03,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash 322299220, now seen corresponding path program 1 times [2024-10-11 03:50:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:03,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212430324] [2024-10-11 03:50:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212430324] [2024-10-11 03:50:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212430324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:50:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775870088] [2024-10-11 03:50:03,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:03,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:50:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:50:03,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:03,555 INFO L87 Difference]: Start difference. First operand 4198 states and 6138 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:04,089 INFO L93 Difference]: Finished difference Result 9286 states and 13636 transitions. [2024-10-11 03:50:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:50:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:04,115 INFO L225 Difference]: With dead ends: 9286 [2024-10-11 03:50:04,116 INFO L226 Difference]: Without dead ends: 8188 [2024-10-11 03:50:04,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:04,117 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 962 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:04,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2279 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2024-10-11 03:50:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 4171. [2024-10-11 03:50:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4170 states have (on average 1.461630695443645) internal successors, (6095), 4170 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 6095 transitions. [2024-10-11 03:50:04,163 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 6095 transitions. Word has length 104 [2024-10-11 03:50:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:04,163 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 6095 transitions. [2024-10-11 03:50:04,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 6095 transitions. [2024-10-11 03:50:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:04,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:04,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:04,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:50:04,165 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1462520652, now seen corresponding path program 1 times [2024-10-11 03:50:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902504866] [2024-10-11 03:50:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902504866] [2024-10-11 03:50:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902504866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2024-10-11 03:50:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835236564] [2024-10-11 03:50:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 03:50:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 03:50:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:50:06,819 INFO L87 Difference]: Start difference. First operand 4171 states and 6095 transitions. Second operand has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:13,454 INFO L93 Difference]: Finished difference Result 8004 states and 11708 transitions. [2024-10-11 03:50:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 03:50:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:13,460 INFO L225 Difference]: With dead ends: 8004 [2024-10-11 03:50:13,460 INFO L226 Difference]: Without dead ends: 7475 [2024-10-11 03:50:13,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=750, Invalid=4652, Unknown=0, NotChecked=0, Total=5402 [2024-10-11 03:50:13,463 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 2501 mSDsluCounter, 12956 mSDsCounter, 0 mSdLazyCounter, 9645 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 13614 SdHoareTripleChecker+Invalid, 9649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:13,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2501 Valid, 13614 Invalid, 9649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9645 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 03:50:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2024-10-11 03:50:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 4204. [2024-10-11 03:50:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4204 states, 4203 states have (on average 1.4603854389721627) internal successors, (6138), 4203 states have internal predecessors, (6138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 6138 transitions. [2024-10-11 03:50:13,511 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 6138 transitions. Word has length 104 [2024-10-11 03:50:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:13,511 INFO L471 AbstractCegarLoop]: Abstraction has 4204 states and 6138 transitions. [2024-10-11 03:50:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.6) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 6138 transitions. [2024-10-11 03:50:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:13,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:13,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:13,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:50:13,512 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:13,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1521278541, now seen corresponding path program 1 times [2024-10-11 03:50:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:13,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697694424] [2024-10-11 03:50:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697694424] [2024-10-11 03:50:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697694424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:50:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443548162] [2024-10-11 03:50:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:50:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:50:13,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:13,999 INFO L87 Difference]: Start difference. First operand 4204 states and 6138 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:14,439 INFO L93 Difference]: Finished difference Result 9292 states and 13633 transitions. [2024-10-11 03:50:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:50:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:14,450 INFO L225 Difference]: With dead ends: 9292 [2024-10-11 03:50:14,450 INFO L226 Difference]: Without dead ends: 8170 [2024-10-11 03:50:14,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:14,454 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 811 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:14,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2175 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2024-10-11 03:50:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 4142. [2024-10-11 03:50:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4142 states, 4141 states have (on average 1.461724221202608) internal successors, (6053), 4141 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 6053 transitions. [2024-10-11 03:50:14,504 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 6053 transitions. Word has length 104 [2024-10-11 03:50:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 4142 states and 6053 transitions. [2024-10-11 03:50:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 6053 transitions. [2024-10-11 03:50:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 03:50:14,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:14,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:50:14,506 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:14,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -461003791, now seen corresponding path program 1 times [2024-10-11 03:50:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305582119] [2024-10-11 03:50:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305582119] [2024-10-11 03:50:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305582119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:50:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546841434] [2024-10-11 03:50:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:50:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:50:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:14,910 INFO L87 Difference]: Start difference. First operand 4142 states and 6053 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:15,277 INFO L93 Difference]: Finished difference Result 9149 states and 13440 transitions. [2024-10-11 03:50:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 03:50:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:15,286 INFO L225 Difference]: With dead ends: 9149 [2024-10-11 03:50:15,286 INFO L226 Difference]: Without dead ends: 8063 [2024-10-11 03:50:15,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:50:15,289 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 766 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:15,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1434 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2024-10-11 03:50:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 4111. [2024-10-11 03:50:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4110 states have (on average 1.4627737226277373) internal successors, (6012), 4110 states have internal predecessors, (6012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6012 transitions. [2024-10-11 03:50:15,339 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6012 transitions. Word has length 104 [2024-10-11 03:50:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 6012 transitions. [2024-10-11 03:50:15,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6012 transitions. [2024-10-11 03:50:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:50:15,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:15,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:15,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:50:15,340 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:15,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash 455388093, now seen corresponding path program 1 times [2024-10-11 03:50:15,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091281311] [2024-10-11 03:50:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091281311] [2024-10-11 03:50:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091281311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:50:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863244636] [2024-10-11 03:50:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:50:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:15,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:50:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:15,790 INFO L87 Difference]: Start difference. First operand 4111 states and 6012 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:16,263 INFO L93 Difference]: Finished difference Result 9137 states and 13426 transitions. [2024-10-11 03:50:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:50:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:50:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:16,270 INFO L225 Difference]: With dead ends: 9137 [2024-10-11 03:50:16,270 INFO L226 Difference]: Without dead ends: 8064 [2024-10-11 03:50:16,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:50:16,273 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 768 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:16,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2037 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2024-10-11 03:50:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 4079. [2024-10-11 03:50:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 4078 states have (on average 1.463707699852869) internal successors, (5969), 4078 states have internal predecessors, (5969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 5969 transitions. [2024-10-11 03:50:16,320 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 5969 transitions. Word has length 105 [2024-10-11 03:50:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:16,320 INFO L471 AbstractCegarLoop]: Abstraction has 4079 states and 5969 transitions. [2024-10-11 03:50:16,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 5969 transitions. [2024-10-11 03:50:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:50:16,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:16,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:50:16,321 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:16,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:16,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1147242339, now seen corresponding path program 1 times [2024-10-11 03:50:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455844319] [2024-10-11 03:50:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455844319] [2024-10-11 03:50:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455844319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:50:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453803959] [2024-10-11 03:50:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:16,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:16,502 INFO L87 Difference]: Start difference. First operand 4079 states and 5969 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:16,530 INFO L93 Difference]: Finished difference Result 4109 states and 6012 transitions. [2024-10-11 03:50:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:50:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:16,534 INFO L225 Difference]: With dead ends: 4109 [2024-10-11 03:50:16,534 INFO L226 Difference]: Without dead ends: 4107 [2024-10-11 03:50:16,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:16,535 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:16,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2024-10-11 03:50:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4107. [2024-10-11 03:50:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4106 states have (on average 1.456648806624452) internal successors, (5981), 4106 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 5981 transitions. [2024-10-11 03:50:16,568 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 5981 transitions. Word has length 105 [2024-10-11 03:50:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:16,568 INFO L471 AbstractCegarLoop]: Abstraction has 4107 states and 5981 transitions. [2024-10-11 03:50:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5981 transitions. [2024-10-11 03:50:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:50:16,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:16,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:16,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:50:16,569 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 140441497, now seen corresponding path program 1 times [2024-10-11 03:50:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:16,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112552382] [2024-10-11 03:50:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112552382] [2024-10-11 03:50:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112552382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:16,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079556168] [2024-10-11 03:50:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:16,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:50:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:50:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:50:16,682 INFO L87 Difference]: Start difference. First operand 4107 states and 5981 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:16,712 INFO L93 Difference]: Finished difference Result 9737 states and 14252 transitions. [2024-10-11 03:50:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:50:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:50:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:16,717 INFO L225 Difference]: With dead ends: 9737 [2024-10-11 03:50:16,717 INFO L226 Difference]: Without dead ends: 5761 [2024-10-11 03:50:16,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:50:16,721 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 106 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:16,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 518 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5761 states. [2024-10-11 03:50:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5761 to 5759. [2024-10-11 03:50:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5759 states, 5758 states have (on average 1.4543244182007642) internal successors, (8374), 5758 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5759 states to 5759 states and 8374 transitions. [2024-10-11 03:50:16,761 INFO L78 Accepts]: Start accepts. Automaton has 5759 states and 8374 transitions. Word has length 105 [2024-10-11 03:50:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:16,761 INFO L471 AbstractCegarLoop]: Abstraction has 5759 states and 8374 transitions. [2024-10-11 03:50:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5759 states and 8374 transitions. [2024-10-11 03:50:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 03:50:16,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:16,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:16,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:50:16,762 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1364166300, now seen corresponding path program 1 times [2024-10-11 03:50:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273356889] [2024-10-11 03:50:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273356889] [2024-10-11 03:50:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273356889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2024-10-11 03:50:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413730913] [2024-10-11 03:50:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 03:50:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 03:50:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:50:19,159 INFO L87 Difference]: Start difference. First operand 5759 states and 8374 transitions. Second operand has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:23,536 INFO L93 Difference]: Finished difference Result 7096 states and 10328 transitions. [2024-10-11 03:50:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 03:50:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-11 03:50:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:23,540 INFO L225 Difference]: With dead ends: 7096 [2024-10-11 03:50:23,540 INFO L226 Difference]: Without dead ends: 5779 [2024-10-11 03:50:23,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=662, Invalid=4450, Unknown=0, NotChecked=0, Total=5112 [2024-10-11 03:50:23,543 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 845 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 3711 SdHoareTripleChecker+Invalid, 3191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:23,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 3711 Invalid, 3191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 03:50:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2024-10-11 03:50:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5776. [2024-10-11 03:50:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 5775 states have (on average 1.4536796536796537) internal successors, (8395), 5775 states have internal predecessors, (8395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 8395 transitions. [2024-10-11 03:50:23,589 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 8395 transitions. Word has length 105 [2024-10-11 03:50:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:23,589 INFO L471 AbstractCegarLoop]: Abstraction has 5776 states and 8395 transitions. [2024-10-11 03:50:23,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 8395 transitions. [2024-10-11 03:50:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:50:23,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:23,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:50:23,590 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 689795251, now seen corresponding path program 1 times [2024-10-11 03:50:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113383470] [2024-10-11 03:50:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113383470] [2024-10-11 03:50:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113383470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:50:24,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004565592] [2024-10-11 03:50:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:24,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:50:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:24,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:50:24,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:24,334 INFO L87 Difference]: Start difference. First operand 5776 states and 8395 transitions. Second operand has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:25,347 INFO L93 Difference]: Finished difference Result 18363 states and 26802 transitions. [2024-10-11 03:50:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:50:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-11 03:50:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:25,366 INFO L225 Difference]: With dead ends: 18363 [2024-10-11 03:50:25,366 INFO L226 Difference]: Without dead ends: 17046 [2024-10-11 03:50:25,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:50:25,373 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1335 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:25,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 3367 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:50:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17046 states. [2024-10-11 03:50:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17046 to 5758. [2024-10-11 03:50:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 5757 states have (on average 1.4542296334896647) internal successors, (8372), 5757 states have internal predecessors, (8372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 8372 transitions. [2024-10-11 03:50:25,485 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 8372 transitions. Word has length 106 [2024-10-11 03:50:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:25,485 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 8372 transitions. [2024-10-11 03:50:25,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 8372 transitions. [2024-10-11 03:50:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:50:25,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:25,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:25,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:50:25,486 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -573869230, now seen corresponding path program 1 times [2024-10-11 03:50:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359140112] [2024-10-11 03:50:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:26,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:26,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359140112] [2024-10-11 03:50:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359140112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:26,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 03:50:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33517162] [2024-10-11 03:50:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:26,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:50:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:50:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:50:26,280 INFO L87 Difference]: Start difference. First operand 5758 states and 8372 transitions. Second operand has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:27,721 INFO L93 Difference]: Finished difference Result 18344 states and 26781 transitions. [2024-10-11 03:50:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 03:50:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-11 03:50:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:27,739 INFO L225 Difference]: With dead ends: 18344 [2024-10-11 03:50:27,740 INFO L226 Difference]: Without dead ends: 17027 [2024-10-11 03:50:27,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:50:27,747 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1022 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:27,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3905 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:50:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2024-10-11 03:50:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 5757. [2024-10-11 03:50:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 5756 states have (on average 1.4541348158443363) internal successors, (8370), 5756 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 8370 transitions. [2024-10-11 03:50:27,862 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 8370 transitions. Word has length 106 [2024-10-11 03:50:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 5757 states and 8370 transitions. [2024-10-11 03:50:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 8370 transitions. [2024-10-11 03:50:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 03:50:27,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:27,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:27,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:50:27,864 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash -29755108, now seen corresponding path program 1 times [2024-10-11 03:50:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:27,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465672213] [2024-10-11 03:50:27,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:27,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465672213] [2024-10-11 03:50:27,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465672213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:27,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:27,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373797060] [2024-10-11 03:50:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:27,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:27,950 INFO L87 Difference]: Start difference. First operand 5757 states and 8370 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:27,983 INFO L93 Difference]: Finished difference Result 11995 states and 17493 transitions. [2024-10-11 03:50:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2024-10-11 03:50:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:27,992 INFO L225 Difference]: With dead ends: 11995 [2024-10-11 03:50:27,992 INFO L226 Difference]: Without dead ends: 8019 [2024-10-11 03:50:27,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:27,997 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 100 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:27,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 470 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8019 states. [2024-10-11 03:50:28,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8019 to 7769. [2024-10-11 03:50:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7769 states, 7768 states have (on average 1.448506694129763) internal successors, (11252), 7768 states have internal predecessors, (11252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7769 states to 7769 states and 11252 transitions. [2024-10-11 03:50:28,078 INFO L78 Accepts]: Start accepts. Automaton has 7769 states and 11252 transitions. Word has length 137 [2024-10-11 03:50:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:28,079 INFO L471 AbstractCegarLoop]: Abstraction has 7769 states and 11252 transitions. [2024-10-11 03:50:28,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7769 states and 11252 transitions. [2024-10-11 03:50:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:50:28,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:28,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:50:28,080 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 870030965, now seen corresponding path program 1 times [2024-10-11 03:50:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85332924] [2024-10-11 03:50:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85332924] [2024-10-11 03:50:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85332924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617621282] [2024-10-11 03:50:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:28,183 INFO L87 Difference]: Start difference. First operand 7769 states and 11252 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:28,462 INFO L93 Difference]: Finished difference Result 21071 states and 30748 transitions. [2024-10-11 03:50:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:50:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 03:50:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:28,478 INFO L225 Difference]: With dead ends: 21071 [2024-10-11 03:50:28,478 INFO L226 Difference]: Without dead ends: 13449 [2024-10-11 03:50:28,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:50:28,487 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1045 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:28,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 497 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13449 states. [2024-10-11 03:50:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13449 to 8327. [2024-10-11 03:50:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8327 states, 8326 states have (on average 1.44451116982945) internal successors, (12027), 8326 states have internal predecessors, (12027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 12027 transitions. [2024-10-11 03:50:28,582 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 12027 transitions. Word has length 139 [2024-10-11 03:50:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:28,582 INFO L471 AbstractCegarLoop]: Abstraction has 8327 states and 12027 transitions. [2024-10-11 03:50:28,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 12027 transitions. [2024-10-11 03:50:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:50:28,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:28,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:28,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:50:28,584 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1991449053, now seen corresponding path program 1 times [2024-10-11 03:50:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:28,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119031568] [2024-10-11 03:50:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119031568] [2024-10-11 03:50:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119031568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586752819] [2024-10-11 03:50:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:28,688 INFO L87 Difference]: Start difference. First operand 8327 states and 12027 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:28,984 INFO L93 Difference]: Finished difference Result 29523 states and 42907 transitions. [2024-10-11 03:50:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:50:28,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 03:50:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:29,001 INFO L225 Difference]: With dead ends: 29523 [2024-10-11 03:50:29,001 INFO L226 Difference]: Without dead ends: 21361 [2024-10-11 03:50:29,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:29,006 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1066 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:29,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 409 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21361 states. [2024-10-11 03:50:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21361 to 17647. [2024-10-11 03:50:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17647 states, 17646 states have (on average 1.4447466848010881) internal successors, (25494), 17646 states have internal predecessors, (25494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17647 states to 17647 states and 25494 transitions. [2024-10-11 03:50:29,153 INFO L78 Accepts]: Start accepts. Automaton has 17647 states and 25494 transitions. Word has length 139 [2024-10-11 03:50:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:29,153 INFO L471 AbstractCegarLoop]: Abstraction has 17647 states and 25494 transitions. [2024-10-11 03:50:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 17647 states and 25494 transitions. [2024-10-11 03:50:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:50:29,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:29,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:29,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:50:29,154 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1918302222, now seen corresponding path program 1 times [2024-10-11 03:50:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935128080] [2024-10-11 03:50:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:29,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935128080] [2024-10-11 03:50:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935128080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631660461] [2024-10-11 03:50:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:29,261 INFO L87 Difference]: Start difference. First operand 17647 states and 25494 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:29,525 INFO L93 Difference]: Finished difference Result 57715 states and 83540 transitions. [2024-10-11 03:50:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:50:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 03:50:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:29,569 INFO L225 Difference]: With dead ends: 57715 [2024-10-11 03:50:29,570 INFO L226 Difference]: Without dead ends: 40233 [2024-10-11 03:50:29,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:29,590 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 981 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:29,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 407 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:50:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40233 states. [2024-10-11 03:50:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40233 to 37447. [2024-10-11 03:50:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37447 states, 37446 states have (on average 1.443465256636223) internal successors, (54052), 37446 states have internal predecessors, (54052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37447 states to 37447 states and 54052 transitions. [2024-10-11 03:50:30,089 INFO L78 Accepts]: Start accepts. Automaton has 37447 states and 54052 transitions. Word has length 139 [2024-10-11 03:50:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:30,089 INFO L471 AbstractCegarLoop]: Abstraction has 37447 states and 54052 transitions. [2024-10-11 03:50:30,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37447 states and 54052 transitions. [2024-10-11 03:50:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:50:30,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:30,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:50:30,091 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -492518246, now seen corresponding path program 1 times [2024-10-11 03:50:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689164019] [2024-10-11 03:50:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689164019] [2024-10-11 03:50:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689164019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245689936] [2024-10-11 03:50:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:30,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:30,225 INFO L87 Difference]: Start difference. First operand 37447 states and 54052 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:30,673 INFO L93 Difference]: Finished difference Result 135211 states and 196126 transitions. [2024-10-11 03:50:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:50:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 03:50:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:30,791 INFO L225 Difference]: With dead ends: 135211 [2024-10-11 03:50:30,791 INFO L226 Difference]: Without dead ends: 97929 [2024-10-11 03:50:30,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:30,840 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1151 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:30,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 411 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97929 states. [2024-10-11 03:50:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97929 to 79367. [2024-10-11 03:50:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79367 states, 79366 states have (on average 1.441624877151425) internal successors, (114416), 79366 states have internal predecessors, (114416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79367 states to 79367 states and 114416 transitions. [2024-10-11 03:50:31,962 INFO L78 Accepts]: Start accepts. Automaton has 79367 states and 114416 transitions. Word has length 139 [2024-10-11 03:50:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:31,962 INFO L471 AbstractCegarLoop]: Abstraction has 79367 states and 114416 transitions. [2024-10-11 03:50:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 79367 states and 114416 transitions. [2024-10-11 03:50:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 03:50:31,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:31,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:31,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:50:31,964 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:31,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1473165216, now seen corresponding path program 1 times [2024-10-11 03:50:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117444930] [2024-10-11 03:50:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117444930] [2024-10-11 03:50:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117444930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259839386] [2024-10-11 03:50:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:32,078 INFO L87 Difference]: Start difference. First operand 79367 states and 114416 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:33,427 INFO L93 Difference]: Finished difference Result 298091 states and 431970 transitions. [2024-10-11 03:50:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:50:33,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-11 03:50:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:33,752 INFO L225 Difference]: With dead ends: 298091 [2024-10-11 03:50:33,752 INFO L226 Difference]: Without dead ends: 218889 [2024-10-11 03:50:33,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:50:33,823 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1236 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:33,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 413 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:50:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218889 states. [2024-10-11 03:50:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218889 to 167847. [2024-10-11 03:50:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167847 states, 167846 states have (on average 1.439653015263992) internal successors, (241640), 167846 states have internal predecessors, (241640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167847 states to 167847 states and 241640 transitions. [2024-10-11 03:50:36,622 INFO L78 Accepts]: Start accepts. Automaton has 167847 states and 241640 transitions. Word has length 139 [2024-10-11 03:50:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:36,622 INFO L471 AbstractCegarLoop]: Abstraction has 167847 states and 241640 transitions. [2024-10-11 03:50:36,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 167847 states and 241640 transitions. [2024-10-11 03:50:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 03:50:36,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:36,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:36,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:50:36,884 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:36,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1306202324, now seen corresponding path program 1 times [2024-10-11 03:50:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716564803] [2024-10-11 03:50:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 03:50:36,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:36,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716564803] [2024-10-11 03:50:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716564803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:36,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145309012] [2024-10-11 03:50:36,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:36,999 INFO L87 Difference]: Start difference. First operand 167847 states and 241640 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:38,228 INFO L93 Difference]: Finished difference Result 325739 states and 468186 transitions. [2024-10-11 03:50:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-11 03:50:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:38,462 INFO L225 Difference]: With dead ends: 325739 [2024-10-11 03:50:38,462 INFO L226 Difference]: Without dead ends: 158051 [2024-10-11 03:50:38,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:38,543 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 93 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:38,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 457 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158051 states. [2024-10-11 03:50:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158051 to 155157. [2024-10-11 03:50:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155157 states, 155156 states have (on average 1.4288522519270928) internal successors, (221695), 155156 states have internal predecessors, (221695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155157 states to 155157 states and 221695 transitions. [2024-10-11 03:50:40,953 INFO L78 Accepts]: Start accepts. Automaton has 155157 states and 221695 transitions. Word has length 170 [2024-10-11 03:50:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,954 INFO L471 AbstractCegarLoop]: Abstraction has 155157 states and 221695 transitions. [2024-10-11 03:50:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 155157 states and 221695 transitions. [2024-10-11 03:50:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 03:50:40,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:40,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 03:50:40,974 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:40,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1017475284, now seen corresponding path program 1 times [2024-10-11 03:50:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797900006] [2024-10-11 03:50:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 03:50:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797900006] [2024-10-11 03:50:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797900006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356198968] [2024-10-11 03:50:41,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:41,105 INFO L87 Difference]: Start difference. First operand 155157 states and 221695 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:42,192 INFO L93 Difference]: Finished difference Result 300425 states and 428385 transitions. [2024-10-11 03:50:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-10-11 03:50:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:42,401 INFO L225 Difference]: With dead ends: 300425 [2024-10-11 03:50:42,402 INFO L226 Difference]: Without dead ends: 145415 [2024-10-11 03:50:42,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:42,470 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 86 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:42,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 458 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145415 states. [2024-10-11 03:50:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145415 to 142629. [2024-10-11 03:50:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142629 states, 142628 states have (on average 1.4177230277364894) internal successors, (202207), 142628 states have internal predecessors, (202207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142629 states to 142629 states and 202207 transitions. [2024-10-11 03:50:44,820 INFO L78 Accepts]: Start accepts. Automaton has 142629 states and 202207 transitions. Word has length 171 [2024-10-11 03:50:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:44,821 INFO L471 AbstractCegarLoop]: Abstraction has 142629 states and 202207 transitions. [2024-10-11 03:50:44,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 142629 states and 202207 transitions. [2024-10-11 03:50:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 03:50:44,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:44,843 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:44,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:50:44,843 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:44,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1968952371, now seen corresponding path program 1 times [2024-10-11 03:50:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717109202] [2024-10-11 03:50:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:50:44,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:44,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717109202] [2024-10-11 03:50:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717109202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319743561] [2024-10-11 03:50:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:44,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:44,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:44,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:44,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:44,945 INFO L87 Difference]: Start difference. First operand 142629 states and 202207 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:45,977 INFO L93 Difference]: Finished difference Result 275369 states and 389409 transitions. [2024-10-11 03:50:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-10-11 03:50:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:46,160 INFO L225 Difference]: With dead ends: 275369 [2024-10-11 03:50:46,161 INFO L226 Difference]: Without dead ends: 132887 [2024-10-11 03:50:46,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:46,227 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 79 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:46,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132887 states. [2024-10-11 03:50:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132887 to 130101. [2024-10-11 03:50:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130101 states, 130100 states have (on average 1.4044504227517294) internal successors, (182719), 130100 states have internal predecessors, (182719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130101 states to 130101 states and 182719 transitions. [2024-10-11 03:50:48,076 INFO L78 Accepts]: Start accepts. Automaton has 130101 states and 182719 transitions. Word has length 172 [2024-10-11 03:50:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:48,076 INFO L471 AbstractCegarLoop]: Abstraction has 130101 states and 182719 transitions. [2024-10-11 03:50:48,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 130101 states and 182719 transitions. [2024-10-11 03:50:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:50:48,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:48,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:48,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 03:50:48,092 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1921043119, now seen corresponding path program 1 times [2024-10-11 03:50:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:48,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753407735] [2024-10-11 03:50:48,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:50:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753407735] [2024-10-11 03:50:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753407735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297052408] [2024-10-11 03:50:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:48,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:48,239 INFO L87 Difference]: Start difference. First operand 130101 states and 182719 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:49,212 INFO L93 Difference]: Finished difference Result 250313 states and 350433 transitions. [2024-10-11 03:50:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-10-11 03:50:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:49,358 INFO L225 Difference]: With dead ends: 250313 [2024-10-11 03:50:49,359 INFO L226 Difference]: Without dead ends: 120359 [2024-10-11 03:50:49,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:49,442 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 72 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:49,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120359 states. [2024-10-11 03:50:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120359 to 117573. [2024-10-11 03:50:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117573 states, 117572 states have (on average 1.388349266832239) internal successors, (163231), 117572 states have internal predecessors, (163231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117573 states to 117573 states and 163231 transitions. [2024-10-11 03:50:51,068 INFO L78 Accepts]: Start accepts. Automaton has 117573 states and 163231 transitions. Word has length 173 [2024-10-11 03:50:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 117573 states and 163231 transitions. [2024-10-11 03:50:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 117573 states and 163231 transitions. [2024-10-11 03:50:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 03:50:51,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:51,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 03:50:51,077 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 196983902, now seen corresponding path program 1 times [2024-10-11 03:50:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685940058] [2024-10-11 03:50:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:50:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685940058] [2024-10-11 03:50:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685940058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:50:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356793793] [2024-10-11 03:50:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:50:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:50:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:51,666 INFO L87 Difference]: Start difference. First operand 117573 states and 163231 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:52,327 INFO L93 Difference]: Finished difference Result 342217 states and 472673 transitions. [2024-10-11 03:50:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:50:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2024-10-11 03:50:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:52,633 INFO L225 Difference]: With dead ends: 342217 [2024-10-11 03:50:52,633 INFO L226 Difference]: Without dead ends: 224791 [2024-10-11 03:50:52,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:50:52,750 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 65 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:52,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 461 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:50:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224791 states. [2024-10-11 03:50:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224791 to 211797. [2024-10-11 03:50:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211797 states, 211796 states have (on average 1.3741477648303084) internal successors, (291039), 211796 states have internal predecessors, (291039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211797 states to 211797 states and 291039 transitions. [2024-10-11 03:50:56,796 INFO L78 Accepts]: Start accepts. Automaton has 211797 states and 291039 transitions. Word has length 174 [2024-10-11 03:50:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:56,797 INFO L471 AbstractCegarLoop]: Abstraction has 211797 states and 291039 transitions. [2024-10-11 03:50:56,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 211797 states and 291039 transitions. [2024-10-11 03:50:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 03:50:56,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:56,810 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:56,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 03:50:56,811 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:50:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1718112526, now seen corresponding path program 1 times [2024-10-11 03:50:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455513605] [2024-10-11 03:50:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455513605] [2024-10-11 03:50:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455513605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:50:57,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182243454] [2024-10-11 03:50:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:57,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:50:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:50:57,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:50:57,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:50:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:57,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 03:50:57,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:50:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:58,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:51:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:51:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182243454] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:51:01,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:51:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-11 03:51:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383563256] [2024-10-11 03:51:01,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:51:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 03:51:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 03:51:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2024-10-11 03:51:01,227 INFO L87 Difference]: Start difference. First operand 211797 states and 291039 transitions. Second operand has 31 states, 31 states have (on average 15.709677419354838) internal successors, (487), 30 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)