./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:36:59,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:36:59,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:36:59,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:36:59,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:36:59,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:36:59,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:36:59,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:36:59,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:36:59,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:36:59,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:36:59,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:36:59,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:36:59,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:36:59,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:36:59,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:36:59,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:36:59,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:36:59,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:36:59,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:36:59,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:36:59,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:36:59,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:36:59,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:36:59,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:36:59,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:36:59,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:36:59,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:36:59,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:36:59,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:36:59,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:36:59,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:36:59,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:36:59,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:36:59,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:36:59,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:36:59,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:36:59,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:36:59,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:36:59,374 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/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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2024-10-12 22:36:59,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:36:59,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:36:59,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:36:59,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:36:59,614 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:36:59,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-10-12 22:37:00,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:37:01,187 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:37:01,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-10-12 22:37:01,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5863b0332/ef9be7ee7d3c46808c08a3b05a289a43/FLAG60a7e544a [2024-10-12 22:37:01,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5863b0332/ef9be7ee7d3c46808c08a3b05a289a43 [2024-10-12 22:37:01,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:37:01,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:37:01,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:01,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:37:01,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:37:01,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:01" (1/1) ... [2024-10-12 22:37:01,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:01, skipping insertion in model container [2024-10-12 22:37:01,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:01" (1/1) ... [2024-10-12 22:37:01,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:37:01,738 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-10-12 22:37:01,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:01,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:37:01,892 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-10-12 22:37:01,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:02,009 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:37:02,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02 WrapperNode [2024-10-12 22:37:02,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:02,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:02,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:37:02,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:37:02,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,250 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-10-12 22:37:02,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:02,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:37:02,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:37:02,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:37:02,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,370 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-12 22:37:02,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:37:02,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:37:02,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:37:02,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:37:02,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (1/1) ... [2024-10-12 22:37:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:02,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:37:02,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:37:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:37:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 22:37:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 22:37:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:37:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:37:02,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:37:02,787 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:37:02,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:37:03,904 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-12 22:37:03,905 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:37:03,965 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:37:03,967 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:37:03,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:03 BoogieIcfgContainer [2024-10-12 22:37:03,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:37:03,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:37:03,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:37:03,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:37:03,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:37:01" (1/3) ... [2024-10-12 22:37:03,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d8a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:03, skipping insertion in model container [2024-10-12 22:37:03,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:02" (2/3) ... [2024-10-12 22:37:03,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d8a52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:03, skipping insertion in model container [2024-10-12 22:37:03,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:03" (3/3) ... [2024-10-12 22:37:03,974 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-10-12 22:37:03,986 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:37:03,986 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:37:04,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:37:04,053 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;@462e891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:37:04,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:37:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 22:37:04,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:04,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:04,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1358744025, now seen corresponding path program 1 times [2024-10-12 22:37:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656760021] [2024-10-12 22:37:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:04,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:04,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:04,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656760021] [2024-10-12 22:37:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656760021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 22:37:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042144805] [2024-10-12 22:37:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:04,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 22:37:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 22:37:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 22:37:04,469 INFO L87 Difference]: Start difference. First operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:04,518 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2024-10-12 22:37:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 22:37:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2024-10-12 22:37:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:04,529 INFO L225 Difference]: With dead ends: 708 [2024-10-12 22:37:04,529 INFO L226 Difference]: Without dead ends: 388 [2024-10-12 22:37:04,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 22:37:04,535 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:04,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-12 22:37:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-12 22:37:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2024-10-12 22:37:04,586 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2024-10-12 22:37:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:04,588 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2024-10-12 22:37:04,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2024-10-12 22:37:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 22:37:04,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:04,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:37:04,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1080158561, now seen corresponding path program 1 times [2024-10-12 22:37:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613752053] [2024-10-12 22:37:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613752053] [2024-10-12 22:37:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613752053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:05,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:05,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105257727] [2024-10-12 22:37:05,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:05,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:05,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:05,374 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:05,431 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2024-10-12 22:37:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:05,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2024-10-12 22:37:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:05,436 INFO L225 Difference]: With dead ends: 392 [2024-10-12 22:37:05,436 INFO L226 Difference]: Without dead ends: 390 [2024-10-12 22:37:05,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:05,437 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:05,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-12 22:37:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-12 22:37:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-10-12 22:37:05,460 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2024-10-12 22:37:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-10-12 22:37:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-10-12 22:37:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 22:37:05,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:05,466 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:05,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:37:05,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash -873127207, now seen corresponding path program 1 times [2024-10-12 22:37:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742524990] [2024-10-12 22:37:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742524990] [2024-10-12 22:37:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742524990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136597584] [2024-10-12 22:37:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:05,810 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:06,103 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2024-10-12 22:37:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:06,104 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-10-12 22:37:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:06,106 INFO L225 Difference]: With dead ends: 970 [2024-10-12 22:37:06,107 INFO L226 Difference]: Without dead ends: 390 [2024-10-12 22:37:06,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:37:06,111 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1090 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:06,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-12 22:37:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-12 22:37:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2024-10-12 22:37:06,128 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2024-10-12 22:37:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:06,130 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2024-10-12 22:37:06,131 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2024-10-12 22:37:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 22:37:06,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:06,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:06,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:37:06,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 52997019, now seen corresponding path program 1 times [2024-10-12 22:37:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154488453] [2024-10-12 22:37:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154488453] [2024-10-12 22:37:06,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154488453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:06,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463077330] [2024-10-12 22:37:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:06,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:06,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:06,380 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:06,402 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2024-10-12 22:37:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-10-12 22:37:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:06,404 INFO L225 Difference]: With dead ends: 713 [2024-10-12 22:37:06,405 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:06,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:06,409 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:06,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-10-12 22:37:06,418 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2024-10-12 22:37:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:06,419 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-10-12 22:37:06,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-10-12 22:37:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 22:37:06,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:06,421 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:06,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:37:06,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:06,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 544942264, now seen corresponding path program 1 times [2024-10-12 22:37:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:06,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810076239] [2024-10-12 22:37:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810076239] [2024-10-12 22:37:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810076239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631733855] [2024-10-12 22:37:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:06,728 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:06,778 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2024-10-12 22:37:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:06,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-10-12 22:37:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:06,780 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:06,780 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:06,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:06,781 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 488 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:06,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1106 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4780361757105944) internal successors, (572), 387 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 578 transitions. [2024-10-12 22:37:06,787 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 578 transitions. Word has length 119 [2024-10-12 22:37:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:06,788 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 578 transitions. [2024-10-12 22:37:06,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 578 transitions. [2024-10-12 22:37:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 22:37:06,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:06,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:06,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:37:06,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:06,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1887785587, now seen corresponding path program 1 times [2024-10-12 22:37:06,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:06,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373326332] [2024-10-12 22:37:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373326332] [2024-10-12 22:37:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373326332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093194231] [2024-10-12 22:37:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:07,025 INFO L87 Difference]: Start difference. First operand 392 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:07,088 INFO L93 Difference]: Finished difference Result 715 states and 1053 transitions. [2024-10-12 22:37:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:07,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-10-12 22:37:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:07,090 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:07,090 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:07,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:07,091 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 1045 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:07,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1106 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-10-12 22:37:07,101 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 120 [2024-10-12 22:37:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-10-12 22:37:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-10-12 22:37:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 22:37:07,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:07,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:37:07,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 419181521, now seen corresponding path program 1 times [2024-10-12 22:37:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491001639] [2024-10-12 22:37:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491001639] [2024-10-12 22:37:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491001639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:07,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:07,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123379439] [2024-10-12 22:37:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:07,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:07,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:07,507 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:07,603 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2024-10-12 22:37:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-10-12 22:37:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:07,605 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:07,605 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:07,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:07,606 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 478 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:07,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1062 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2024-10-12 22:37:07,617 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2024-10-12 22:37:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:07,618 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2024-10-12 22:37:07,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2024-10-12 22:37:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 22:37:07,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:07,619 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:07,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:37:07,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:07,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1729788827, now seen corresponding path program 1 times [2024-10-12 22:37:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286104503] [2024-10-12 22:37:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286104503] [2024-10-12 22:37:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286104503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290107316] [2024-10-12 22:37:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:07,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:07,884 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:07,954 INFO L93 Difference]: Finished difference Result 717 states and 1051 transitions. [2024-10-12 22:37:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-10-12 22:37:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:07,956 INFO L225 Difference]: With dead ends: 717 [2024-10-12 22:37:07,956 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:07,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:07,957 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 481 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:07,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1663 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-10-12 22:37:07,964 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2024-10-12 22:37:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:07,964 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-10-12 22:37:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-10-12 22:37:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 22:37:07,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:07,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:07,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:37:07,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:07,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:07,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1505220458, now seen corresponding path program 1 times [2024-10-12 22:37:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:07,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573668093] [2024-10-12 22:37:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:07,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573668093] [2024-10-12 22:37:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573668093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:08,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:08,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:08,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744594581] [2024-10-12 22:37:08,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:08,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:08,192 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:08,272 INFO L93 Difference]: Finished difference Result 715 states and 1047 transitions. [2024-10-12 22:37:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-10-12 22:37:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:08,274 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:08,274 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:08,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:08,275 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 1027 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:08,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1062 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-12 22:37:08,282 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2024-10-12 22:37:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:08,282 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-12 22:37:08,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-12 22:37:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 22:37:08,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:08,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:37:08,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1504860571, now seen corresponding path program 1 times [2024-10-12 22:37:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438175905] [2024-10-12 22:37:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438175905] [2024-10-12 22:37:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438175905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220860352] [2024-10-12 22:37:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:08,486 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:08,573 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2024-10-12 22:37:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-10-12 22:37:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:08,575 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:08,575 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:08,576 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 553 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:08,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1068 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2024-10-12 22:37:08,585 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2024-10-12 22:37:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2024-10-12 22:37:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2024-10-12 22:37:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 22:37:08,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:08,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:08,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:37:08,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:08,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -577416317, now seen corresponding path program 1 times [2024-10-12 22:37:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252040608] [2024-10-12 22:37:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 22:37:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 22:37:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252040608] [2024-10-12 22:37:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252040608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:08,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:08,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855905656] [2024-10-12 22:37:08,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:08,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:08,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:08,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:08,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:08,895 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:08,953 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2024-10-12 22:37:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 125 [2024-10-12 22:37:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:08,955 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:08,955 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:08,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:08,956 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 519 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:08,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2024-10-12 22:37:08,963 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2024-10-12 22:37:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:08,964 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2024-10-12 22:37:08,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2024-10-12 22:37:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 22:37:08,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:08,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:08,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:37:08,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1617002421, now seen corresponding path program 1 times [2024-10-12 22:37:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:08,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872615118] [2024-10-12 22:37:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872615118] [2024-10-12 22:37:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872615118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:09,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309410197] [2024-10-12 22:37:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:09,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:09,323 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:09,408 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2024-10-12 22:37:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-10-12 22:37:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:09,410 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:09,410 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:09,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:09,411 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 475 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:09,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1060 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2024-10-12 22:37:09,421 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2024-10-12 22:37:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:09,421 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2024-10-12 22:37:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2024-10-12 22:37:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 22:37:09,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:09,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:09,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:37:09,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:09,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 384933465, now seen corresponding path program 1 times [2024-10-12 22:37:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142059706] [2024-10-12 22:37:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142059706] [2024-10-12 22:37:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142059706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017035592] [2024-10-12 22:37:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:09,772 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:09,869 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2024-10-12 22:37:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2024-10-12 22:37:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:09,871 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:09,871 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:09,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:09,872 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 938 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:09,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1060 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2024-10-12 22:37:09,879 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2024-10-12 22:37:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:09,880 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2024-10-12 22:37:09,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2024-10-12 22:37:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 22:37:09,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:09,881 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:09,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:37:09,881 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:09,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1126086004, now seen corresponding path program 1 times [2024-10-12 22:37:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739568803] [2024-10-12 22:37:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739568803] [2024-10-12 22:37:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739568803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924608416] [2024-10-12 22:37:10,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:10,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:10,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:10,279 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:10,392 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2024-10-12 22:37:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-10-12 22:37:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:10,398 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:10,398 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:10,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:10,399 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 470 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:10,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1066 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2024-10-12 22:37:10,410 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2024-10-12 22:37:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:10,411 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2024-10-12 22:37:10,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2024-10-12 22:37:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 22:37:10,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:10,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:10,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:37:10,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1478743000, now seen corresponding path program 1 times [2024-10-12 22:37:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942860916] [2024-10-12 22:37:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 22:37:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 22:37:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942860916] [2024-10-12 22:37:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942860916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:10,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524377314] [2024-10-12 22:37:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:10,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:10,727 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:10,811 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2024-10-12 22:37:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 129 [2024-10-12 22:37:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:10,813 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:10,813 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:10,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:10,814 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 514 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:10,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2024-10-12 22:37:10,825 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2024-10-12 22:37:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:10,826 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2024-10-12 22:37:10,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:37:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2024-10-12 22:37:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 22:37:10,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:10,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:10,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:37:10,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:10,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -23884227, now seen corresponding path program 1 times [2024-10-12 22:37:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:10,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685279443] [2024-10-12 22:37:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:11,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685279443] [2024-10-12 22:37:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685279443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:11,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478150695] [2024-10-12 22:37:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:11,204 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:11,277 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2024-10-12 22:37:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:11,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-10-12 22:37:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:11,279 INFO L225 Difference]: With dead ends: 715 [2024-10-12 22:37:11,279 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 22:37:11,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:11,280 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 474 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:11,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1088 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 22:37:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-12 22:37:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2024-10-12 22:37:11,289 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2024-10-12 22:37:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:11,289 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2024-10-12 22:37:11,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2024-10-12 22:37:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 22:37:11,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:11,290 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 22:37:11,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:11,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1259931877, now seen corresponding path program 1 times [2024-10-12 22:37:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822368966] [2024-10-12 22:37:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 22:37:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 22:37:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 22:37:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822368966] [2024-10-12 22:37:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822368966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:12,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:12,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:37:12,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704162919] [2024-10-12 22:37:12,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:12,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:37:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:12,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:37:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:12,036 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:12,300 INFO L93 Difference]: Finished difference Result 779 states and 1124 transitions. [2024-10-12 22:37:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:37:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-10-12 22:37:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:12,302 INFO L225 Difference]: With dead ends: 779 [2024-10-12 22:37:12,302 INFO L226 Difference]: Without dead ends: 394 [2024-10-12 22:37:12,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:37:12,303 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 641 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:12,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2555 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-12 22:37:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-10-12 22:37:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4447300771208227) internal successors, (562), 389 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 568 transitions. [2024-10-12 22:37:12,311 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 568 transitions. Word has length 131 [2024-10-12 22:37:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:12,311 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 568 transitions. [2024-10-12 22:37:12,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 568 transitions. [2024-10-12 22:37:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 22:37:12,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:12,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:12,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 22:37:12,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 633723290, now seen corresponding path program 1 times [2024-10-12 22:37:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033047867] [2024-10-12 22:37:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033047867] [2024-10-12 22:37:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033047867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807018903] [2024-10-12 22:37:12,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:12,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:12,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:12,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:12,724 INFO L87 Difference]: Start difference. First operand 394 states and 568 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:13,000 INFO L93 Difference]: Finished difference Result 723 states and 1039 transitions. [2024-10-12 22:37:13,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-10-12 22:37:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:13,003 INFO L225 Difference]: With dead ends: 723 [2024-10-12 22:37:13,003 INFO L226 Difference]: Without dead ends: 398 [2024-10-12 22:37:13,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:13,004 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 519 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:13,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1221 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-12 22:37:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-10-12 22:37:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4424552429667519) internal successors, (564), 391 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 22:37:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 570 transitions. [2024-10-12 22:37:13,012 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 570 transitions. Word has length 132 [2024-10-12 22:37:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 570 transitions. [2024-10-12 22:37:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 570 transitions. [2024-10-12 22:37:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 22:37:13,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:13,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 22:37:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 22:37:13,014 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1221276731, now seen corresponding path program 1 times [2024-10-12 22:37:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241826075] [2024-10-12 22:37:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:37:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241826075] [2024-10-12 22:37:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241826075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945867909] [2024-10-12 22:37:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:13,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:13,549 INFO L87 Difference]: Start difference. First operand 396 states and 570 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:13,640 INFO L93 Difference]: Finished difference Result 847 states and 1207 transitions. [2024-10-12 22:37:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:13,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-10-12 22:37:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:13,642 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:13,642 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:13,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:13,643 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 858 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:13,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 2192 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.419921875) internal successors, (727), 512 states have internal predecessors, (727), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 739 transitions. [2024-10-12 22:37:13,656 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 739 transitions. Word has length 133 [2024-10-12 22:37:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 739 transitions. [2024-10-12 22:37:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 739 transitions. [2024-10-12 22:37:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-12 22:37:13,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:13,659 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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-12 22:37:13,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 22:37:13,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2067336047, now seen corresponding path program 1 times [2024-10-12 22:37:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342429695] [2024-10-12 22:37:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-12 22:37:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-12 22:37:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-12 22:37:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342429695] [2024-10-12 22:37:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342429695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400534116] [2024-10-12 22:37:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:14,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:14,246 INFO L87 Difference]: Start difference. First operand 520 states and 739 transitions. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:14,330 INFO L93 Difference]: Finished difference Result 847 states and 1206 transitions. [2024-10-12 22:37:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321 [2024-10-12 22:37:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:14,333 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:14,333 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:14,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:14,334 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 938 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:14,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1054 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.41796875) internal successors, (726), 512 states have internal predecessors, (726), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 738 transitions. [2024-10-12 22:37:14,349 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 738 transitions. Word has length 321 [2024-10-12 22:37:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 738 transitions. [2024-10-12 22:37:14,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 738 transitions. [2024-10-12 22:37:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-12 22:37:14,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:14,353 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:14,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 22:37:14,354 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:14,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 228376191, now seen corresponding path program 1 times [2024-10-12 22:37:14,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807786769] [2024-10-12 22:37:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-12 22:37:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-12 22:37:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-12 22:37:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807786769] [2024-10-12 22:37:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807786769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950791884] [2024-10-12 22:37:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:14,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:14,935 INFO L87 Difference]: Start difference. First operand 520 states and 738 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:15,030 INFO L93 Difference]: Finished difference Result 847 states and 1204 transitions. [2024-10-12 22:37:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322 [2024-10-12 22:37:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:15,034 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:15,034 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:15,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:15,035 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 922 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:15,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1054 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.416015625) internal successors, (725), 512 states have internal predecessors, (725), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 737 transitions. [2024-10-12 22:37:15,050 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 737 transitions. Word has length 322 [2024-10-12 22:37:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 737 transitions. [2024-10-12 22:37:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 737 transitions. [2024-10-12 22:37:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-12 22:37:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:15,053 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 22:37:15,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:15,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1691436634, now seen corresponding path program 1 times [2024-10-12 22:37:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:15,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123084263] [2024-10-12 22:37:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-12 22:37:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 22:37:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 22:37:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123084263] [2024-10-12 22:37:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123084263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418899786] [2024-10-12 22:37:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:15,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:15,625 INFO L87 Difference]: Start difference. First operand 520 states and 737 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:15,695 INFO L93 Difference]: Finished difference Result 847 states and 1202 transitions. [2024-10-12 22:37:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2024-10-12 22:37:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:15,697 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:15,697 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:15,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:15,698 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 499 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:15,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1060 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.4140625) internal successors, (724), 512 states have internal predecessors, (724), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 736 transitions. [2024-10-12 22:37:15,708 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 736 transitions. Word has length 323 [2024-10-12 22:37:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 736 transitions. [2024-10-12 22:37:15,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 736 transitions. [2024-10-12 22:37:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-12 22:37:15,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:15,711 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:15,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 22:37:15,712 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:15,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1573691638, now seen corresponding path program 1 times [2024-10-12 22:37:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521710399] [2024-10-12 22:37:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-12 22:37:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-12 22:37:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-12 22:37:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521710399] [2024-10-12 22:37:16,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521710399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:16,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:16,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545282818] [2024-10-12 22:37:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:16,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:16,205 INFO L87 Difference]: Start difference. First operand 520 states and 736 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:16,271 INFO L93 Difference]: Finished difference Result 847 states and 1200 transitions. [2024-10-12 22:37:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-10-12 22:37:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:16,273 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:16,273 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:16,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:16,274 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 491 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:16,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1060 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.412109375) internal successors, (723), 512 states have internal predecessors, (723), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 735 transitions. [2024-10-12 22:37:16,283 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 735 transitions. Word has length 324 [2024-10-12 22:37:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:16,283 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 735 transitions. [2024-10-12 22:37:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 735 transitions. [2024-10-12 22:37:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-12 22:37:16,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:16,286 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:16,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 22:37:16,286 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 148635077, now seen corresponding path program 1 times [2024-10-12 22:37:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709773343] [2024-10-12 22:37:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-12 22:37:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-12 22:37:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-12 22:37:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709773343] [2024-10-12 22:37:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709773343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:16,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510311091] [2024-10-12 22:37:16,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:16,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:16,793 INFO L87 Difference]: Start difference. First operand 520 states and 735 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:16,876 INFO L93 Difference]: Finished difference Result 847 states and 1198 transitions. [2024-10-12 22:37:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:16,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-10-12 22:37:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:16,879 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:16,879 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:16,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:16,880 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 867 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:16,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1078 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.41015625) internal successors, (722), 512 states have internal predecessors, (722), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 734 transitions. [2024-10-12 22:37:16,891 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 734 transitions. Word has length 325 [2024-10-12 22:37:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:16,891 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 734 transitions. [2024-10-12 22:37:16,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 734 transitions. [2024-10-12 22:37:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-12 22:37:16,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:16,894 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:16,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 22:37:16,895 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1072495595, now seen corresponding path program 1 times [2024-10-12 22:37:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303116870] [2024-10-12 22:37:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-12 22:37:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-12 22:37:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303116870] [2024-10-12 22:37:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303116870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528020416] [2024-10-12 22:37:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:17,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:17,468 INFO L87 Difference]: Start difference. First operand 520 states and 734 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:17,542 INFO L93 Difference]: Finished difference Result 847 states and 1196 transitions. [2024-10-12 22:37:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-12 22:37:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:17,545 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:17,545 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:17,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:17,546 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 468 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:17,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1084 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.408203125) internal successors, (721), 512 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 733 transitions. [2024-10-12 22:37:17,554 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 733 transitions. Word has length 326 [2024-10-12 22:37:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:17,555 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 733 transitions. [2024-10-12 22:37:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 733 transitions. [2024-10-12 22:37:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 22:37:17,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:17,558 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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] [2024-10-12 22:37:17,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 22:37:17,558 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -97324624, now seen corresponding path program 1 times [2024-10-12 22:37:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91163401] [2024-10-12 22:37:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-12 22:37:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-12 22:37:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-12 22:37:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91163401] [2024-10-12 22:37:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91163401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:18,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:18,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649292465] [2024-10-12 22:37:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:18,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:18,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:18,195 INFO L87 Difference]: Start difference. First operand 520 states and 733 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:18,573 INFO L93 Difference]: Finished difference Result 847 states and 1194 transitions. [2024-10-12 22:37:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-10-12 22:37:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:18,576 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:18,576 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:18,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:18,577 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 791 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:18,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 798 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.40625) internal successors, (720), 512 states have internal predecessors, (720), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 732 transitions. [2024-10-12 22:37:18,592 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 732 transitions. Word has length 327 [2024-10-12 22:37:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:18,593 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 732 transitions. [2024-10-12 22:37:18,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 732 transitions. [2024-10-12 22:37:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 22:37:18,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:18,595 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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-12 22:37:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 22:37:18,596 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2059702880, now seen corresponding path program 1 times [2024-10-12 22:37:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717893661] [2024-10-12 22:37:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-12 22:37:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:37:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-12 22:37:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:19,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717893661] [2024-10-12 22:37:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717893661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:19,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800181823] [2024-10-12 22:37:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:19,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:19,727 INFO L87 Difference]: Start difference. First operand 520 states and 732 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:19,796 INFO L93 Difference]: Finished difference Result 847 states and 1192 transitions. [2024-10-12 22:37:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-10-12 22:37:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:19,798 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:19,798 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:19,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:19,799 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 382 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:19,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1076 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.404296875) internal successors, (719), 512 states have internal predecessors, (719), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 731 transitions. [2024-10-12 22:37:19,813 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 731 transitions. Word has length 328 [2024-10-12 22:37:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:19,814 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 731 transitions. [2024-10-12 22:37:19,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 731 transitions. [2024-10-12 22:37:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-12 22:37:19,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:19,815 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1] [2024-10-12 22:37:19,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 22:37:19,816 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1673418174, now seen corresponding path program 1 times [2024-10-12 22:37:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531411975] [2024-10-12 22:37:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-12 22:37:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-12 22:37:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-12 22:37:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531411975] [2024-10-12 22:37:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531411975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024874277] [2024-10-12 22:37:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:20,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:20,711 INFO L87 Difference]: Start difference. First operand 520 states and 731 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:20,839 INFO L93 Difference]: Finished difference Result 847 states and 1190 transitions. [2024-10-12 22:37:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-10-12 22:37:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:20,842 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:20,842 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:20,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:20,843 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 862 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:20,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1046 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.40234375) internal successors, (718), 512 states have internal predecessors, (718), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 730 transitions. [2024-10-12 22:37:20,853 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 730 transitions. Word has length 329 [2024-10-12 22:37:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:20,854 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 730 transitions. [2024-10-12 22:37:20,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 730 transitions. [2024-10-12 22:37:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-12 22:37:20,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:20,856 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1] [2024-10-12 22:37:20,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 22:37:20,856 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:20,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash 478045984, now seen corresponding path program 1 times [2024-10-12 22:37:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777204831] [2024-10-12 22:37:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:20,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-12 22:37:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-12 22:37:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-12 22:37:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777204831] [2024-10-12 22:37:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777204831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103536370] [2024-10-12 22:37:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:21,593 INFO L87 Difference]: Start difference. First operand 520 states and 730 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:21,663 INFO L93 Difference]: Finished difference Result 847 states and 1188 transitions. [2024-10-12 22:37:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:21,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-10-12 22:37:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:21,665 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:21,665 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:21,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:21,666 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 453 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:21,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1052 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.400390625) internal successors, (717), 512 states have internal predecessors, (717), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 729 transitions. [2024-10-12 22:37:21,674 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 729 transitions. Word has length 330 [2024-10-12 22:37:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:21,674 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 729 transitions. [2024-10-12 22:37:21,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 729 transitions. [2024-10-12 22:37:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-12 22:37:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:21,676 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1] [2024-10-12 22:37:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 22:37:21,676 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1791399503, now seen corresponding path program 1 times [2024-10-12 22:37:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190034996] [2024-10-12 22:37:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-12 22:37:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-12 22:37:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-12 22:37:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190034996] [2024-10-12 22:37:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190034996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941244855] [2024-10-12 22:37:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:22,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:22,361 INFO L87 Difference]: Start difference. First operand 520 states and 729 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:22,422 INFO L93 Difference]: Finished difference Result 847 states and 1186 transitions. [2024-10-12 22:37:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:22,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-10-12 22:37:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:22,424 INFO L225 Difference]: With dead ends: 847 [2024-10-12 22:37:22,424 INFO L226 Difference]: Without dead ends: 520 [2024-10-12 22:37:22,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:22,425 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 391 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:22,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1046 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-12 22:37:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-10-12 22:37:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 512 states have (on average 1.3984375) internal successors, (716), 512 states have internal predecessors, (716), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 728 transitions. [2024-10-12 22:37:22,435 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 728 transitions. Word has length 331 [2024-10-12 22:37:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:22,435 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 728 transitions. [2024-10-12 22:37:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 728 transitions. [2024-10-12 22:37:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-12 22:37:22,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:22,438 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1] [2024-10-12 22:37:22,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 22:37:22,438 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:22,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash -807468593, now seen corresponding path program 1 times [2024-10-12 22:37:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:22,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980633764] [2024-10-12 22:37:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-12 22:37:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-12 22:37:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 22:37:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980633764] [2024-10-12 22:37:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980633764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:23,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:23,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028058619] [2024-10-12 22:37:23,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:23,547 INFO L87 Difference]: Start difference. First operand 520 states and 728 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:23,578 INFO L93 Difference]: Finished difference Result 941 states and 1300 transitions. [2024-10-12 22:37:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-10-12 22:37:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:23,580 INFO L225 Difference]: With dead ends: 941 [2024-10-12 22:37:23,580 INFO L226 Difference]: Without dead ends: 612 [2024-10-12 22:37:23,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12 22:37:23,582 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 19 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:23,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2170 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-12 22:37:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2024-10-12 22:37:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.37) internal successors, (822), 600 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:37:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 834 transitions. [2024-10-12 22:37:23,591 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 834 transitions. Word has length 332 [2024-10-12 22:37:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 834 transitions. [2024-10-12 22:37:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 834 transitions. [2024-10-12 22:37:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-12 22:37:23,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:23,593 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1] [2024-10-12 22:37:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 22:37:23,594 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:23,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1991437285, now seen corresponding path program 1 times [2024-10-12 22:37:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545059103] [2024-10-12 22:37:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-12 22:37:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-12 22:37:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-12 22:37:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:24,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545059103] [2024-10-12 22:37:24,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545059103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:24,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:24,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885470458] [2024-10-12 22:37:24,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:24,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:24,589 INFO L87 Difference]: Start difference. First operand 608 states and 834 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:25,098 INFO L93 Difference]: Finished difference Result 1428 states and 1964 transitions. [2024-10-12 22:37:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-10-12 22:37:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:25,102 INFO L225 Difference]: With dead ends: 1428 [2024-10-12 22:37:25,102 INFO L226 Difference]: Without dead ends: 1057 [2024-10-12 22:37:25,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:25,106 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 354 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:25,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2275 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-10-12 22:37:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 935. [2024-10-12 22:37:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3658008658008658) internal successors, (1262), 924 states have internal predecessors, (1262), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 22:37:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1280 transitions. [2024-10-12 22:37:25,137 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1280 transitions. Word has length 334 [2024-10-12 22:37:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1280 transitions. [2024-10-12 22:37:25,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1280 transitions. [2024-10-12 22:37:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-12 22:37:25,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:25,141 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2024-10-12 22:37:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 22:37:25,142 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2061663201, now seen corresponding path program 1 times [2024-10-12 22:37:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417738303] [2024-10-12 22:37:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-12 22:37:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-12 22:37:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:37:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-12 22:37:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417738303] [2024-10-12 22:37:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417738303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151900199] [2024-10-12 22:37:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:26,545 INFO L87 Difference]: Start difference. First operand 935 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:26,803 INFO L93 Difference]: Finished difference Result 1600 states and 2168 transitions. [2024-10-12 22:37:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 335 [2024-10-12 22:37:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:26,806 INFO L225 Difference]: With dead ends: 1600 [2024-10-12 22:37:26,806 INFO L226 Difference]: Without dead ends: 947 [2024-10-12 22:37:26,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:26,807 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 323 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:26,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1197 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:37:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-12 22:37:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 941. [2024-10-12 22:37:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 930 states have (on average 1.3634408602150538) internal successors, (1268), 930 states have internal predecessors, (1268), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 22:37:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1286 transitions. [2024-10-12 22:37:26,824 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1286 transitions. Word has length 335 [2024-10-12 22:37:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1286 transitions. [2024-10-12 22:37:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1286 transitions. [2024-10-12 22:37:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-12 22:37:26,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:26,826 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2024-10-12 22:37:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 22:37:26,827 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash 62409665, now seen corresponding path program 1 times [2024-10-12 22:37:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130610845] [2024-10-12 22:37:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-12 22:37:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-12 22:37:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:37:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-12 22:37:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130610845] [2024-10-12 22:37:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130610845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124306056] [2024-10-12 22:37:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:28,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:28,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:28,128 INFO L87 Difference]: Start difference. First operand 941 states and 1286 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:28,500 INFO L93 Difference]: Finished difference Result 1794 states and 2386 transitions. [2024-10-12 22:37:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:37:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 335 [2024-10-12 22:37:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:28,503 INFO L225 Difference]: With dead ends: 1794 [2024-10-12 22:37:28,503 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 22:37:28,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-12 22:37:28,504 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 390 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:28,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1637 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 22:37:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 941. [2024-10-12 22:37:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 930 states have (on average 1.356989247311828) internal successors, (1262), 930 states have internal predecessors, (1262), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 22:37:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1280 transitions. [2024-10-12 22:37:28,517 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1280 transitions. Word has length 335 [2024-10-12 22:37:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:28,518 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1280 transitions. [2024-10-12 22:37:28,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1280 transitions. [2024-10-12 22:37:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 22:37:28,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:28,520 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2024-10-12 22:37:28,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 22:37:28,520 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:28,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1562655833, now seen corresponding path program 1 times [2024-10-12 22:37:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911044355] [2024-10-12 22:37:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-12 22:37:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 22:37:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-12 22:37:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911044355] [2024-10-12 22:37:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911044355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:29,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:29,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068521291] [2024-10-12 22:37:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:29,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:29,439 INFO L87 Difference]: Start difference. First operand 941 states and 1280 transitions. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:29,852 INFO L93 Difference]: Finished difference Result 1337 states and 1823 transitions. [2024-10-12 22:37:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:29,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-10-12 22:37:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:29,856 INFO L225 Difference]: With dead ends: 1337 [2024-10-12 22:37:29,856 INFO L226 Difference]: Without dead ends: 964 [2024-10-12 22:37:29,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-12 22:37:29,857 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 763 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:29,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1567 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-10-12 22:37:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 942. [2024-10-12 22:37:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 931 states have (on average 1.3566058002148227) internal successors, (1263), 931 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 22:37:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1281 transitions. [2024-10-12 22:37:29,871 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1281 transitions. Word has length 337 [2024-10-12 22:37:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:29,871 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1281 transitions. [2024-10-12 22:37:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1281 transitions. [2024-10-12 22:37:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 22:37:29,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:29,873 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2024-10-12 22:37:29,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 22:37:29,874 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:29,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1688389854, now seen corresponding path program 1 times [2024-10-12 22:37:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656113853] [2024-10-12 22:37:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-12 22:37:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-12 22:37:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-12 22:37:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-12 22:37:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656113853] [2024-10-12 22:37:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656113853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:30,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:30,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:37:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68032206] [2024-10-12 22:37:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:30,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:37:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:37:30,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:37:30,941 INFO L87 Difference]: Start difference. First operand 942 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:31,065 INFO L93 Difference]: Finished difference Result 2125 states and 2882 transitions. [2024-10-12 22:37:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:37:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-10-12 22:37:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:31,070 INFO L225 Difference]: With dead ends: 2125 [2024-10-12 22:37:31,070 INFO L226 Difference]: Without dead ends: 1634 [2024-10-12 22:37:31,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:31,071 INFO L432 NwaCegarLoop]: 1263 mSDtfsCounter, 829 mSDsluCounter, 5429 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:31,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 6692 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-10-12 22:37:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1011. [2024-10-12 22:37:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3590772316950852) internal successors, (1355), 997 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1379 transitions. [2024-10-12 22:37:31,089 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1379 transitions. Word has length 337 [2024-10-12 22:37:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1379 transitions. [2024-10-12 22:37:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1379 transitions. [2024-10-12 22:37:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-12 22:37:31,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:31,092 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 22:37:31,092 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1114654100, now seen corresponding path program 1 times [2024-10-12 22:37:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669425593] [2024-10-12 22:37:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 22:37:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 22:37:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 22:37:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-12 22:37:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-12 22:37:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-12 22:37:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-12 22:37:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669425593] [2024-10-12 22:37:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669425593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:37:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999805332] [2024-10-12 22:37:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:32,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:37:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:37:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:37:32,247 INFO L87 Difference]: Start difference. First operand 1011 states and 1379 transitions. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:32,657 INFO L93 Difference]: Finished difference Result 1879 states and 2551 transitions. [2024-10-12 22:37:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 338 [2024-10-12 22:37:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:32,661 INFO L225 Difference]: With dead ends: 1879 [2024-10-12 22:37:32,661 INFO L226 Difference]: Without dead ends: 1019 [2024-10-12 22:37:32,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:32,663 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 511 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:32,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1551 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-12 22:37:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1015. [2024-10-12 22:37:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1001 states have (on average 1.3576423576423577) internal successors, (1359), 1001 states have internal predecessors, (1359), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1383 transitions. [2024-10-12 22:37:32,685 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1383 transitions. Word has length 338 [2024-10-12 22:37:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:32,686 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1383 transitions. [2024-10-12 22:37:32,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1383 transitions. [2024-10-12 22:37:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-12 22:37:32,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:32,689 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:32,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 22:37:32,689 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash -135458990, now seen corresponding path program 1 times [2024-10-12 22:37:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:32,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857166577] [2024-10-12 22:37:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 22:37:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 22:37:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-12 22:37:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-12 22:37:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-12 22:37:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-12 22:37:33,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:33,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857166577] [2024-10-12 22:37:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857166577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:33,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:33,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:37:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042191296] [2024-10-12 22:37:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:33,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:37:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:37:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:37:33,651 INFO L87 Difference]: Start difference. First operand 1015 states and 1383 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:37:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:34,048 INFO L93 Difference]: Finished difference Result 1850 states and 2511 transitions. [2024-10-12 22:37:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:34,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-10-12 22:37:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:34,051 INFO L225 Difference]: With dead ends: 1850 [2024-10-12 22:37:34,051 INFO L226 Difference]: Without dead ends: 1031 [2024-10-12 22:37:34,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:37:34,052 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 538 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:34,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1553 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-12 22:37:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1023. [2024-10-12 22:37:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1009 states have (on average 1.3508424182358771) internal successors, (1363), 1009 states have internal predecessors, (1363), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1387 transitions. [2024-10-12 22:37:34,067 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1387 transitions. Word has length 340 [2024-10-12 22:37:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:34,067 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1387 transitions. [2024-10-12 22:37:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:37:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1387 transitions. [2024-10-12 22:37:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 22:37:34,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:34,070 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:34,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 22:37:34,070 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:34,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1016454220, now seen corresponding path program 1 times [2024-10-12 22:37:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392086558] [2024-10-12 22:37:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:34,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 22:37:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 22:37:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-12 22:37:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-12 22:37:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-12 22:37:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392086558] [2024-10-12 22:37:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392086558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:37:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834207775] [2024-10-12 22:37:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:37:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:35,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:37:35,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 22:37:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:36,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 2041 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 22:37:36,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:37:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 22:37:37,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:37:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 22:37:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834207775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:37:38,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 22:37:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2024-10-12 22:37:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129082167] [2024-10-12 22:37:38,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 22:37:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 22:37:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 22:37:38,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2024-10-12 22:37:38,244 INFO L87 Difference]: Start difference. First operand 1023 states and 1387 transitions. Second operand has 26 states, 26 states have (on average 32.80769230769231) internal successors, (853), 26 states have internal predecessors, (853), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-12 22:37:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:39,816 INFO L93 Difference]: Finished difference Result 1860 states and 2516 transitions. [2024-10-12 22:37:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 22:37:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 32.80769230769231) internal successors, (853), 26 states have internal predecessors, (853), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 342 [2024-10-12 22:37:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:39,819 INFO L225 Difference]: With dead ends: 1860 [2024-10-12 22:37:39,819 INFO L226 Difference]: Without dead ends: 1051 [2024-10-12 22:37:39,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1889, Unknown=0, NotChecked=0, Total=2256 [2024-10-12 22:37:39,821 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 1102 mSDsluCounter, 6388 mSDsCounter, 0 mSdLazyCounter, 3372 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 6869 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:39,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 6869 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 22:37:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-12 22:37:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1040. [2024-10-12 22:37:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1026 states have (on average 1.3421052631578947) internal successors, (1377), 1026 states have internal predecessors, (1377), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1401 transitions. [2024-10-12 22:37:39,836 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1401 transitions. Word has length 342 [2024-10-12 22:37:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1401 transitions. [2024-10-12 22:37:39,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.80769230769231) internal successors, (853), 26 states have internal predecessors, (853), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-12 22:37:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1401 transitions. [2024-10-12 22:37:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-12 22:37:39,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,839 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:39,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 22:37:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-12 22:37:40,044 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1536229955, now seen corresponding path program 1 times [2024-10-12 22:37:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299001530] [2024-10-12 22:37:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:37:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:37:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-12 22:37:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299001530] [2024-10-12 22:37:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299001530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682600382] [2024-10-12 22:37:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:40,537 INFO L87 Difference]: Start difference. First operand 1040 states and 1401 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,574 INFO L93 Difference]: Finished difference Result 1716 states and 2316 transitions. [2024-10-12 22:37:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348 [2024-10-12 22:37:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,578 INFO L225 Difference]: With dead ends: 1716 [2024-10-12 22:37:40,578 INFO L226 Difference]: Without dead ends: 1094 [2024-10-12 22:37:40,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-12 22:37:40,579 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 16 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:40,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2167 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:37:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-12 22:37:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2024-10-12 22:37:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1080 states have (on average 1.3472222222222223) internal successors, (1455), 1080 states have internal predecessors, (1455), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 22:37:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1479 transitions. [2024-10-12 22:37:40,613 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1479 transitions. Word has length 348 [2024-10-12 22:37:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,614 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1479 transitions. [2024-10-12 22:37:40,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 22:37:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1479 transitions. [2024-10-12 22:37:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:37:40,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,619 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 22:37:40,619 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1231735407, now seen corresponding path program 1 times [2024-10-12 22:37:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997220960] [2024-10-12 22:37:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:37:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:37:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 22:37:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997220960] [2024-10-12 22:37:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997220960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:42,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 22:37:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262806348] [2024-10-12 22:37:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:42,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 22:37:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 22:37:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:37:42,600 INFO L87 Difference]: Start difference. First operand 1094 states and 1479 transitions. Second operand has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:37:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:43,563 INFO L93 Difference]: Finished difference Result 2641 states and 3535 transitions. [2024-10-12 22:37:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:37:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-12 22:37:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:43,568 INFO L225 Difference]: With dead ends: 2641 [2024-10-12 22:37:43,568 INFO L226 Difference]: Without dead ends: 1887 [2024-10-12 22:37:43,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:37:43,569 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 885 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:43,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 3260 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 22:37:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-12 22:37:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1240. [2024-10-12 22:37:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1222 states have (on average 1.3494271685761048) internal successors, (1649), 1222 states have internal predecessors, (1649), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 22:37:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1681 transitions. [2024-10-12 22:37:43,591 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1681 transitions. Word has length 349 [2024-10-12 22:37:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:43,592 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1681 transitions. [2024-10-12 22:37:43,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:37:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1681 transitions. [2024-10-12 22:37:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:37:43,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:43,594 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:43,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 22:37:43,594 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 623555153, now seen corresponding path program 1 times [2024-10-12 22:37:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272518693] [2024-10-12 22:37:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:37:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:37:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 22:37:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272518693] [2024-10-12 22:37:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272518693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:45,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:45,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 22:37:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947706614] [2024-10-12 22:37:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:45,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 22:37:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 22:37:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 22:37:45,993 INFO L87 Difference]: Start difference. First operand 1240 states and 1681 transitions. Second operand has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:37:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:46,346 INFO L93 Difference]: Finished difference Result 2352 states and 3184 transitions. [2024-10-12 22:37:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 22:37:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349 [2024-10-12 22:37:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:46,357 INFO L225 Difference]: With dead ends: 2352 [2024-10-12 22:37:46,358 INFO L226 Difference]: Without dead ends: 1633 [2024-10-12 22:37:46,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:37:46,359 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 1715 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 5806 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:46,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 5806 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:37:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-10-12 22:37:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1304. [2024-10-12 22:37:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1283 states have (on average 1.3468433359314107) internal successors, (1728), 1283 states have internal predecessors, (1728), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 22:37:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1766 transitions. [2024-10-12 22:37:46,417 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1766 transitions. Word has length 349 [2024-10-12 22:37:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1766 transitions. [2024-10-12 22:37:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:37:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1766 transitions. [2024-10-12 22:37:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:37:46,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:46,424 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 22:37:46,425 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1783097521, now seen corresponding path program 1 times [2024-10-12 22:37:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945187996] [2024-10-12 22:37:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:37:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-12 22:37:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-12 22:37:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-12 22:37:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:37:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945187996] [2024-10-12 22:37:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945187996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:37:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014059343] [2024-10-12 22:37:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:52,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:37:52,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:52,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:37:52,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 22:37:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 2052 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 22:37:53,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:37:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 22:37:53,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:37:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014059343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:37:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2024-10-12 22:37:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413115894] [2024-10-12 22:37:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:37:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:37:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-10-12 22:37:53,860 INFO L87 Difference]: Start difference. First operand 1304 states and 1766 transitions. Second operand has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:54,333 INFO L93 Difference]: Finished difference Result 2862 states and 3881 transitions. [2024-10-12 22:37:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:37:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349 [2024-10-12 22:37:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:54,337 INFO L225 Difference]: With dead ends: 2862 [2024-10-12 22:37:54,337 INFO L226 Difference]: Without dead ends: 2277 [2024-10-12 22:37:54,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-10-12 22:37:54,339 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1280 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:54,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1862 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-10-12 22:37:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1931. [2024-10-12 22:37:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1895 states have (on average 1.3324538258575198) internal successors, (2525), 1895 states have internal predecessors, (2525), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:37:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2593 transitions. [2024-10-12 22:37:54,371 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2593 transitions. Word has length 349 [2024-10-12 22:37:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:54,371 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2593 transitions. [2024-10-12 22:37:54,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:37:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2593 transitions. [2024-10-12 22:37:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-12 22:37:54,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:54,374 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:37:54,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 22:37:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-10-12 22:37:54,576 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1244060080, now seen corresponding path program 1 times [2024-10-12 22:37:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:54,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052517434] [2024-10-12 22:37:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:37:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:37:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:37:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-12 22:37:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-12 22:37:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-12 22:37:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 22:37:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052517434] [2024-10-12 22:37:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052517434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:37:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594818631] [2024-10-12 22:37:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:37:58,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:58,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:37:58,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 22:38:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:00,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 2055 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 22:38:00,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 22:38:00,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:38:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594818631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:38:00,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-12 22:38:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168292708] [2024-10-12 22:38:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:00,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:00,224 INFO L87 Difference]: Start difference. First operand 1931 states and 2593 transitions. Second operand has 6 states, 5 states have (on average 60.2) internal successors, (301), 6 states have internal predecessors, (301), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:00,320 INFO L93 Difference]: Finished difference Result 3262 states and 4375 transitions. [2024-10-12 22:38:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.2) internal successors, (301), 6 states have internal predecessors, (301), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 350 [2024-10-12 22:38:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:00,329 INFO L225 Difference]: With dead ends: 3262 [2024-10-12 22:38:00,333 INFO L226 Difference]: Without dead ends: 1931 [2024-10-12 22:38:00,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:00,335 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:00,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2703 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:38:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-10-12 22:38:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1931. [2024-10-12 22:38:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1895 states have (on average 1.3229551451187336) internal successors, (2507), 1895 states have internal predecessors, (2507), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2575 transitions. [2024-10-12 22:38:00,403 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2575 transitions. Word has length 350 [2024-10-12 22:38:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:00,404 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2575 transitions. [2024-10-12 22:38:00,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.2) internal successors, (301), 6 states have internal predecessors, (301), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 22:38:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2575 transitions. [2024-10-12 22:38:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:00,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:00,411 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:00,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 22:38:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:00,612 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:00,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1735365702, now seen corresponding path program 1 times [2024-10-12 22:38:00,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520685843] [2024-10-12 22:38:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 22:38:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520685843] [2024-10-12 22:38:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520685843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:01,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 22:38:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795463072] [2024-10-12 22:38:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:01,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:38:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:38:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:38:01,778 INFO L87 Difference]: Start difference. First operand 1931 states and 2575 transitions. Second operand has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:02,350 INFO L93 Difference]: Finished difference Result 3311 states and 4391 transitions. [2024-10-12 22:38:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:38:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2024-10-12 22:38:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:02,354 INFO L225 Difference]: With dead ends: 3311 [2024-10-12 22:38:02,354 INFO L226 Difference]: Without dead ends: 2760 [2024-10-12 22:38:02,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:38:02,356 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 718 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:02,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2195 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2024-10-12 22:38:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2526. [2024-10-12 22:38:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3036144578313253) internal successors, (3246), 2490 states have internal predecessors, (3246), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3314 transitions. [2024-10-12 22:38:02,390 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3314 transitions. Word has length 352 [2024-10-12 22:38:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:02,390 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3314 transitions. [2024-10-12 22:38:02,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 22:38:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3314 transitions. [2024-10-12 22:38:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:02,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:02,394 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 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-12 22:38:02,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 22:38:02,394 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash 921459997, now seen corresponding path program 1 times [2024-10-12 22:38:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985086081] [2024-10-12 22:38:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 22:38:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 50 proven. 35 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 22:38:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985086081] [2024-10-12 22:38:07,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985086081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:07,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736228708] [2024-10-12 22:38:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:07,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:07,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:07,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 22:38:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 22:38:08,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 22:38:08,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:38:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736228708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 22:38:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-10-12 22:38:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480965301] [2024-10-12 22:38:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:09,000 INFO L87 Difference]: Start difference. First operand 2526 states and 3314 transitions. Second operand has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 22:38:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:09,057 INFO L93 Difference]: Finished difference Result 4574 states and 5982 transitions. [2024-10-12 22:38:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352 [2024-10-12 22:38:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:09,061 INFO L225 Difference]: With dead ends: 4574 [2024-10-12 22:38:09,061 INFO L226 Difference]: Without dead ends: 2526 [2024-10-12 22:38:09,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-10-12 22:38:09,063 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:09,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2698 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:38:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-10-12 22:38:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2526. [2024-10-12 22:38:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2490 states have (on average 1.3008032128514055) internal successors, (3239), 2490 states have internal predecessors, (3239), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-12 22:38:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3307 transitions. [2024-10-12 22:38:09,095 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3307 transitions. Word has length 352 [2024-10-12 22:38:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3307 transitions. [2024-10-12 22:38:09,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 55.0) internal successors, (275), 6 states have internal predecessors, (275), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 22:38:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3307 transitions. [2024-10-12 22:38:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:09,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:09,099 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 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-12 22:38:09,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 22:38:09,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:09,300 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:09,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash 775757118, now seen corresponding path program 1 times [2024-10-12 22:38:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844145935] [2024-10-12 22:38:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 22:38:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 22:38:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844145935] [2024-10-12 22:38:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844145935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409377598] [2024-10-12 22:38:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:10,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:10,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:10,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:10,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:10,290 INFO L87 Difference]: Start difference. First operand 2526 states and 3307 transitions. Second operand has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:10,825 INFO L93 Difference]: Finished difference Result 4016 states and 5274 transitions. [2024-10-12 22:38:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-10-12 22:38:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:10,830 INFO L225 Difference]: With dead ends: 4016 [2024-10-12 22:38:10,830 INFO L226 Difference]: Without dead ends: 3423 [2024-10-12 22:38:10,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 22:38:10,832 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 747 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:10,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 2455 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2024-10-12 22:38:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 2600. [2024-10-12 22:38:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2562 states have (on average 1.3021077283372364) internal successors, (3336), 2562 states have internal predecessors, (3336), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-12 22:38:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3408 transitions. [2024-10-12 22:38:10,870 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3408 transitions. Word has length 352 [2024-10-12 22:38:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:10,871 INFO L471 AbstractCegarLoop]: Abstraction has 2600 states and 3408 transitions. [2024-10-12 22:38:10,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3408 transitions. [2024-10-12 22:38:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:10,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:10,875 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:38:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 22:38:10,875 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1772218397, now seen corresponding path program 1 times [2024-10-12 22:38:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528514693] [2024-10-12 22:38:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 22:38:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 22:38:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 22:38:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-12 22:38:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-12 22:38:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-12 22:38:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528514693] [2024-10-12 22:38:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528514693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 22:38:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020278314] [2024-10-12 22:38:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 22:38:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 22:38:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 22:38:12,500 INFO L87 Difference]: Start difference. First operand 2600 states and 3408 transitions. Second operand has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:13,290 INFO L93 Difference]: Finished difference Result 6712 states and 8804 transitions. [2024-10-12 22:38:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 22:38:13,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352 [2024-10-12 22:38:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:13,300 INFO L225 Difference]: With dead ends: 6712 [2024-10-12 22:38:13,300 INFO L226 Difference]: Without dead ends: 6119 [2024-10-12 22:38:13,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-12 22:38:13,305 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 5025 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:13,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 2746 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 22:38:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2024-10-12 22:38:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 2774. [2024-10-12 22:38:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2728 states have (on average 1.3013196480938416) internal successors, (3550), 2728 states have internal predecessors, (3550), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-12 22:38:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3638 transitions. [2024-10-12 22:38:13,423 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3638 transitions. Word has length 352 [2024-10-12 22:38:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:13,424 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 3638 transitions. [2024-10-12 22:38:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.545454545454547) internal successors, (325), 11 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3638 transitions. [2024-10-12 22:38:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 22:38:13,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:13,428 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 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-12 22:38:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 22:38:13,428 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1494012478, now seen corresponding path program 1 times [2024-10-12 22:38:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11604714] [2024-10-12 22:38:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 22:38:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 22:38:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-12 22:38:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-12 22:38:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-12 22:38:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-12 22:38:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11604714] [2024-10-12 22:38:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11604714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:13,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:38:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660033839] [2024-10-12 22:38:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:38:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:38:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:14,000 INFO L87 Difference]: Start difference. First operand 2774 states and 3638 transitions. Second operand has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:14,284 INFO L93 Difference]: Finished difference Result 4496 states and 5862 transitions. [2024-10-12 22:38:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:38:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2024-10-12 22:38:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:14,293 INFO L225 Difference]: With dead ends: 4496 [2024-10-12 22:38:14,297 INFO L226 Difference]: Without dead ends: 2854 [2024-10-12 22:38:14,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:38:14,304 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 504 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:14,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1571 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:38:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-12 22:38:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2814. [2024-10-12 22:38:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2768 states have (on average 1.2969653179190752) internal successors, (3590), 2768 states have internal predecessors, (3590), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-12 22:38:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3678 transitions. [2024-10-12 22:38:14,386 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3678 transitions. Word has length 353 [2024-10-12 22:38:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:14,386 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 3678 transitions. [2024-10-12 22:38:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 22:38:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3678 transitions. [2024-10-12 22:38:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 22:38:14,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:14,391 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 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, 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, 1, 1, 1, 1, 1, 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-12 22:38:14,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 22:38:14,391 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:14,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:14,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1230543474, now seen corresponding path program 1 times [2024-10-12 22:38:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697417654] [2024-10-12 22:38:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 22:38:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 22:38:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 22:38:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-12 22:38:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-12 22:38:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-12 22:38:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:18,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697417654] [2024-10-12 22:38:18,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697417654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:38:18,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737680471] [2024-10-12 22:38:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:18,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 22:38:18,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:38:18,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 22:38:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 22:38:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:20,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-12 22:38:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:38:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 22:38:21,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:38:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 82 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 22:38:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737680471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 22:38:22,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 22:38:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2024-10-12 22:38:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911247760] [2024-10-12 22:38:22,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 22:38:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-12 22:38:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-12 22:38:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2024-10-12 22:38:22,869 INFO L87 Difference]: Start difference. First operand 2814 states and 3678 transitions. Second operand has 38 states, 38 states have (on average 21.973684210526315) internal successors, (835), 38 states have internal predecessors, (835), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18)