./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_w32_d64_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_w32_d64_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 7774fb409350dc00c3d500df28dd72c255cd5cce7d940160e8eab25f2539ec00 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:37:26,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:37:26,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:37:26,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:37:26,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:37:26,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:37:26,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:37:26,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:37:26,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:37:26,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:37:26,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:37:26,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:37:26,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:37:26,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:37:26,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:37:26,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:37:26,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:37:26,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:37:26,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:37:26,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:37:26,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:37:26,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:37:26,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:37:26,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:37:26,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:37:26,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:37:26,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:37:26,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:37:26,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:37:26,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:26,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:37:26,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:37:26,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:37:26,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:37:26,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:37:26,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:37:26,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:37:26,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:37:26,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:37:26,613 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 -> 7774fb409350dc00c3d500df28dd72c255cd5cce7d940160e8eab25f2539ec00 [2024-10-12 22:37:26,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:37:26,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:37:26,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:37:26,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:37:26,893 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:37:26,894 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_w32_d64_e0.c [2024-10-12 22:37:28,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:37:28,660 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:37:28,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d64_e0.c [2024-10-12 22:37:28,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c496bc0c4/26486e86b02344b69d534120759d4495/FLAG9716372c0 [2024-10-12 22:37:28,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c496bc0c4/26486e86b02344b69d534120759d4495 [2024-10-12 22:37:28,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:37:28,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:37:28,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:28,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:37:28,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:37:28,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:28" (1/1) ... [2024-10-12 22:37:28,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d990aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:28, skipping insertion in model container [2024-10-12 22:37:28,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:37:28" (1/1) ... [2024-10-12 22:37:28,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:37:29,210 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_w32_d64_e0.c[1280,1293] [2024-10-12 22:37:29,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:29,700 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:37:29,712 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_w32_d64_e0.c[1280,1293] [2024-10-12 22:37:29,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:37:29,905 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:37:29,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:29 WrapperNode [2024-10-12 22:37:29,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:37:29,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:29,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:37:29,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:37:29,914 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:29" (1/1) ... [2024-10-12 22:37:29,978 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:29" (1/1) ... [2024-10-12 22:37:30,533 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5533 [2024-10-12 22:37:30,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:37:30,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:37:30,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:37:30,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:37:30,550 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:29" (1/1) ... [2024-10-12 22:37:30,554 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:29" (1/1) ... [2024-10-12 22:37:30,728 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:29" (1/1) ... [2024-10-12 22:37:30,866 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:30,867 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:29" (1/1) ... [2024-10-12 22:37:30,867 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:29" (1/1) ... [2024-10-12 22:37:31,120 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:29" (1/1) ... [2024-10-12 22:37:31,160 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:29" (1/1) ... [2024-10-12 22:37:31,221 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:29" (1/1) ... [2024-10-12 22:37:31,252 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:29" (1/1) ... [2024-10-12 22:37:31,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:37:31,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:37:31,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:37:31,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:37:31,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:29" (1/1) ... [2024-10-12 22:37:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:37:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:37:31,398 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:31,402 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:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:37:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 22:37:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 22:37:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:37:31,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:37:31,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:37:31,873 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:37:31,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:37:38,946 INFO L? ?]: Removed 3109 outVars from TransFormulas that were not future-live. [2024-10-12 22:37:38,946 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:37:39,109 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:37:39,110 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:37:39,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:39 BoogieIcfgContainer [2024-10-12 22:37:39,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:37:39,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:37:39,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:37:39,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:37:39,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:37:28" (1/3) ... [2024-10-12 22:37:39,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f718a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:39, skipping insertion in model container [2024-10-12 22:37:39,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:37:29" (2/3) ... [2024-10-12 22:37:39,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f718a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:37:39, skipping insertion in model container [2024-10-12 22:37:39,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:37:39" (3/3) ... [2024-10-12 22:37:39,121 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d64_e0.c [2024-10-12 22:37:39,140 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:37:39,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:37:39,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:37:39,267 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;@30c6f978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:37:39,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:37:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 1509 states, 1503 states have (on average 1.4990019960079841) internal successors, (2253), 1504 states have internal predecessors, (2253), 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:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-12 22:37:39,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:39,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 189766823, now seen corresponding path program 1 times [2024-10-12 22:37:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108563663] [2024-10-12 22:37:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:40,308 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:40,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108563663] [2024-10-12 22:37:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108563663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 22:37:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088776594] [2024-10-12 22:37:40,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:40,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 22:37:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 22:37:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 22:37:40,354 INFO L87 Difference]: Start difference. First operand has 1509 states, 1503 states have (on average 1.4990019960079841) internal successors, (2253), 1504 states have internal predecessors, (2253), 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 164.0) internal successors, (328), 2 states have internal predecessors, (328), 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:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:40,469 INFO L93 Difference]: Finished difference Result 2724 states and 4082 transitions. [2024-10-12 22:37:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 22:37:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 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 340 [2024-10-12 22:37:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:40,496 INFO L225 Difference]: With dead ends: 2724 [2024-10-12 22:37:40,497 INFO L226 Difference]: Without dead ends: 1508 [2024-10-12 22:37:40,507 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:40,512 INFO L432 NwaCegarLoop]: 2255 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, 2255 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:40,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2255 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:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2024-10-12 22:37:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2024-10-12 22:37:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1503 states have (on average 1.4970059880239521) internal successors, (2250), 1503 states have internal predecessors, (2250), 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:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2256 transitions. [2024-10-12 22:37:40,649 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2256 transitions. Word has length 340 [2024-10-12 22:37:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:40,653 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2256 transitions. [2024-10-12 22:37:40,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 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:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2256 transitions. [2024-10-12 22:37:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-12 22:37:40,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:40,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:37:40,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:40,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1984797727, now seen corresponding path program 1 times [2024-10-12 22:37:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780176698] [2024-10-12 22:37:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:43,040 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:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780176698] [2024-10-12 22:37:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780176698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:43,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983749964] [2024-10-12 22:37:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:43,049 INFO L87 Difference]: Start difference. First operand 1508 states and 2256 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:43,122 INFO L93 Difference]: Finished difference Result 1512 states and 2260 transitions. [2024-10-12 22:37:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:43,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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 340 [2024-10-12 22:37:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:43,132 INFO L225 Difference]: With dead ends: 1512 [2024-10-12 22:37:43,133 INFO L226 Difference]: Without dead ends: 1510 [2024-10-12 22:37:43,134 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:43,136 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 0 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6754 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:43,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6754 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:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-12 22:37:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2024-10-12 22:37:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1505 states have (on average 1.496345514950166) internal successors, (2252), 1505 states have internal predecessors, (2252), 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:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2258 transitions. [2024-10-12 22:37:43,176 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2258 transitions. Word has length 340 [2024-10-12 22:37:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:43,178 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2258 transitions. [2024-10-12 22:37:43,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 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:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2258 transitions. [2024-10-12 22:37:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-12 22:37:43,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:43,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:37:43,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:43,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1397490167, now seen corresponding path program 1 times [2024-10-12 22:37:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302902695] [2024-10-12 22:37:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:44,343 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:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302902695] [2024-10-12 22:37:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302902695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578346993] [2024-10-12 22:37:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:44,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:44,347 INFO L87 Difference]: Start difference. First operand 1510 states and 2258 transitions. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:45,280 INFO L93 Difference]: Finished difference Result 3770 states and 5640 transitions. [2024-10-12 22:37:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:37:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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 341 [2024-10-12 22:37:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:45,289 INFO L225 Difference]: With dead ends: 3770 [2024-10-12 22:37:45,290 INFO L226 Difference]: Without dead ends: 1510 [2024-10-12 22:37:45,293 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:45,295 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 4786 mSDsluCounter, 4079 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 6330 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:45,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 6330 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 22:37:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-12 22:37:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2024-10-12 22:37:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1505 states have (on average 1.4956810631229236) internal successors, (2251), 1505 states have internal predecessors, (2251), 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:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2257 transitions. [2024-10-12 22:37:45,340 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2257 transitions. Word has length 341 [2024-10-12 22:37:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2257 transitions. [2024-10-12 22:37:45,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2257 transitions. [2024-10-12 22:37:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 22:37:45,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:45,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:37:45,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1929197203, now seen corresponding path program 1 times [2024-10-12 22:37:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:45,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299656995] [2024-10-12 22:37:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:46,684 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:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:46,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299656995] [2024-10-12 22:37:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299656995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:46,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:46,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430435435] [2024-10-12 22:37:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:46,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:46,688 INFO L87 Difference]: Start difference. First operand 1510 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:46,755 INFO L93 Difference]: Finished difference Result 2729 states and 4078 transitions. [2024-10-12 22:37:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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 342 [2024-10-12 22:37:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:46,763 INFO L225 Difference]: With dead ends: 2729 [2024-10-12 22:37:46,763 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:46,767 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:46,768 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 0 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6748 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:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6748 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:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4950232249502322) internal successors, (2253), 1507 states have internal predecessors, (2253), 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:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2259 transitions. [2024-10-12 22:37:46,804 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2259 transitions. Word has length 342 [2024-10-12 22:37:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2259 transitions. [2024-10-12 22:37:46,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2259 transitions. [2024-10-12 22:37:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-12 22:37:46,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:46,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:37:46,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1422392720, now seen corresponding path program 1 times [2024-10-12 22:37:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755895547] [2024-10-12 22:37:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:48,246 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:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755895547] [2024-10-12 22:37:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755895547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:48,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:48,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485525115] [2024-10-12 22:37:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:48,251 INFO L87 Difference]: Start difference. First operand 1512 states and 2259 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:48,431 INFO L93 Difference]: Finished difference Result 2731 states and 4079 transitions. [2024-10-12 22:37:48,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:48,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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 343 [2024-10-12 22:37:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:48,439 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:48,439 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:48,444 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:48,446 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 2052 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 4426 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:48,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 4426 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:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4943596549435965) internal successors, (2252), 1507 states have internal predecessors, (2252), 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:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2258 transitions. [2024-10-12 22:37:48,493 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2258 transitions. Word has length 343 [2024-10-12 22:37:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:48,494 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2258 transitions. [2024-10-12 22:37:48,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2258 transitions. [2024-10-12 22:37:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-12 22:37:48,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:48,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:37:48,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:48,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1352511067, now seen corresponding path program 1 times [2024-10-12 22:37:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802331166] [2024-10-12 22:37:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:49,661 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:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:49,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802331166] [2024-10-12 22:37:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802331166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071772980] [2024-10-12 22:37:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:49,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:49,667 INFO L87 Difference]: Start difference. First operand 1512 states and 2258 transitions. Second operand has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 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:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:49,831 INFO L93 Difference]: Finished difference Result 2731 states and 4077 transitions. [2024-10-12 22:37:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 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 344 [2024-10-12 22:37:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:49,838 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:49,839 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:49,841 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:49,843 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 4289 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4292 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:49,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4292 Valid, 4426 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:37:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.493696084936961) internal successors, (2251), 1507 states have internal predecessors, (2251), 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:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2257 transitions. [2024-10-12 22:37:49,888 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2257 transitions. Word has length 344 [2024-10-12 22:37:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:49,889 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2257 transitions. [2024-10-12 22:37:49,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 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:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2257 transitions. [2024-10-12 22:37:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-12 22:37:49,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:49,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:37:49,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:49,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash -649362615, now seen corresponding path program 1 times [2024-10-12 22:37:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:49,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193407416] [2024-10-12 22:37:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:50,932 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:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193407416] [2024-10-12 22:37:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193407416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554535206] [2024-10-12 22:37:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:50,935 INFO L87 Difference]: Start difference. First operand 1512 states and 2257 transitions. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:51,084 INFO L93 Difference]: Finished difference Result 2731 states and 4075 transitions. [2024-10-12 22:37:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:51,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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 345 [2024-10-12 22:37:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:51,092 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:51,092 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:51,095 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:51,095 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 2239 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 4432 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:51,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2242 Valid, 4432 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:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4930325149303252) internal successors, (2250), 1507 states have internal predecessors, (2250), 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:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2256 transitions. [2024-10-12 22:37:51,136 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2256 transitions. Word has length 345 [2024-10-12 22:37:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:51,137 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2256 transitions. [2024-10-12 22:37:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2256 transitions. [2024-10-12 22:37:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-12 22:37:51,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:51,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:37:51,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 221600414, now seen corresponding path program 1 times [2024-10-12 22:37:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119074799] [2024-10-12 22:37:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:52,003 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:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119074799] [2024-10-12 22:37:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119074799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122999450] [2024-10-12 22:37:52,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:52,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:52,009 INFO L87 Difference]: Start difference. First operand 1512 states and 2256 transitions. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:52,164 INFO L93 Difference]: Finished difference Result 2731 states and 4073 transitions. [2024-10-12 22:37:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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 346 [2024-10-12 22:37:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:52,171 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:52,171 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:52,174 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:52,176 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 4273 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4276 SdHoareTripleChecker+Valid, 4426 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:52,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4276 Valid, 4426 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:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4923689449236894) internal successors, (2249), 1507 states have internal predecessors, (2249), 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:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2255 transitions. [2024-10-12 22:37:52,213 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2255 transitions. Word has length 346 [2024-10-12 22:37:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:52,214 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2255 transitions. [2024-10-12 22:37:52,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2255 transitions. [2024-10-12 22:37:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-12 22:37:52,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:52,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 22:37:52,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:52,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 924847266, now seen corresponding path program 1 times [2024-10-12 22:37:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714020161] [2024-10-12 22:37:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:53,540 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:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714020161] [2024-10-12 22:37:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714020161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:37:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432051507] [2024-10-12 22:37:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:37:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:37:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:37:53,544 INFO L87 Difference]: Start difference. First operand 1512 states and 2255 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:54,236 INFO L93 Difference]: Finished difference Result 2731 states and 4071 transitions. [2024-10-12 22:37:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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 347 [2024-10-12 22:37:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:54,244 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:54,244 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:54,246 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:54,248 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 1928 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:54,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 3858 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 22:37:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4917053749170537) internal successors, (2248), 1507 states have internal predecessors, (2248), 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:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2254 transitions. [2024-10-12 22:37:54,285 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2254 transitions. Word has length 347 [2024-10-12 22:37:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:54,286 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2254 transitions. [2024-10-12 22:37:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2254 transitions. [2024-10-12 22:37:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-12 22:37:54,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:54,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 22:37:54,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1978408413, now seen corresponding path program 1 times [2024-10-12 22:37:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778239649] [2024-10-12 22:37:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:55,170 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:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:55,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778239649] [2024-10-12 22:37:55,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778239649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:55,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:55,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422843454] [2024-10-12 22:37:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:55,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:55,174 INFO L87 Difference]: Start difference. First operand 1512 states and 2254 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 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:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:55,687 INFO L93 Difference]: Finished difference Result 2791 states and 4158 transitions. [2024-10-12 22:37:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:37:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 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:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:55,694 INFO L225 Difference]: With dead ends: 2791 [2024-10-12 22:37:55,694 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:55,697 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:55,697 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 2047 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 6359 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:55,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 6359 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:37:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4910418049104182) internal successors, (2247), 1507 states have internal predecessors, (2247), 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:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2253 transitions. [2024-10-12 22:37:55,732 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2253 transitions. Word has length 348 [2024-10-12 22:37:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2253 transitions. [2024-10-12 22:37:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 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:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2253 transitions. [2024-10-12 22:37:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 22:37:55,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:55,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 22:37:55,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:55,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1798911408, now seen corresponding path program 1 times [2024-10-12 22:37:55,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:55,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799977586] [2024-10-12 22:37:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:56,655 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:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799977586] [2024-10-12 22:37:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799977586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:56,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089618714] [2024-10-12 22:37:56,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:56,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:56,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:56,659 INFO L87 Difference]: Start difference. First operand 1512 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:57,259 INFO L93 Difference]: Finished difference Result 2731 states and 4067 transitions. [2024-10-12 22:37:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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 349 [2024-10-12 22:37:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:57,266 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:57,266 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:57,269 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:57,269 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2238 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:57,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 3864 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4903782349037824) internal successors, (2246), 1507 states have internal predecessors, (2246), 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:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2252 transitions. [2024-10-12 22:37:57,310 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2252 transitions. Word has length 349 [2024-10-12 22:37:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:57,311 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2252 transitions. [2024-10-12 22:37:57,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2252 transitions. [2024-10-12 22:37:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-12 22:37:57,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:57,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 22:37:57,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:57,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1047504420, now seen corresponding path program 1 times [2024-10-12 22:37:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254573808] [2024-10-12 22:37:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:58,178 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:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254573808] [2024-10-12 22:37:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254573808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:58,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820642244] [2024-10-12 22:37:58,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:58,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:58,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:58,182 INFO L87 Difference]: Start difference. First operand 1512 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:37:58,780 INFO L93 Difference]: Finished difference Result 2731 states and 4065 transitions. [2024-10-12 22:37:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:37:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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 350 [2024-10-12 22:37:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:37:58,789 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:37:58,790 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:37:58,792 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:58,793 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2234 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2237 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:37:58,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2237 Valid, 3864 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:37:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:37:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:37:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4897146648971467) internal successors, (2245), 1507 states have internal predecessors, (2245), 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:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2251 transitions. [2024-10-12 22:37:58,826 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2251 transitions. Word has length 350 [2024-10-12 22:37:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:37:58,827 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2251 transitions. [2024-10-12 22:37:58,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2251 transitions. [2024-10-12 22:37:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-12 22:37:58,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:37:58,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 22:37:58,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:37:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:37:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1213194281, now seen corresponding path program 1 times [2024-10-12 22:37:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:37:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513728467] [2024-10-12 22:37:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:37:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:37:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:37:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:37:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:37:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:37:59,714 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:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:37:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513728467] [2024-10-12 22:37:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513728467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:37:59,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:37:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:37:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19908297] [2024-10-12 22:37:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:37:59,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:37:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:37:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:37:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:37:59,717 INFO L87 Difference]: Start difference. First operand 1512 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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:38:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:00,301 INFO L93 Difference]: Finished difference Result 2731 states and 4063 transitions. [2024-10-12 22:38:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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 351 [2024-10-12 22:38:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:00,308 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:00,308 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:00,310 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:38:00,311 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4203 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:00,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 3858 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.489051094890511) internal successors, (2244), 1507 states have internal predecessors, (2244), 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:38:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2250 transitions. [2024-10-12 22:38:00,341 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2250 transitions. Word has length 351 [2024-10-12 22:38:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:00,341 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2250 transitions. [2024-10-12 22:38:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 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:38:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2250 transitions. [2024-10-12 22:38:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 22:38:00,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:00,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 22:38:00,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 271087083, now seen corresponding path program 1 times [2024-10-12 22:38:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140801365] [2024-10-12 22:38:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:01,407 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:38:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140801365] [2024-10-12 22:38:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140801365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813203881] [2024-10-12 22:38:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:01,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:01,410 INFO L87 Difference]: Start difference. First operand 1512 states and 2250 transitions. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 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:38:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:02,045 INFO L93 Difference]: Finished difference Result 2731 states and 4061 transitions. [2024-10-12 22:38:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 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 352 [2024-10-12 22:38:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:02,052 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:02,052 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:02,054 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:38:02,055 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2226 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:02,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 3864 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 22:38:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4883875248838752) internal successors, (2243), 1507 states have internal predecessors, (2243), 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:38:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2249 transitions. [2024-10-12 22:38:02,091 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2249 transitions. Word has length 352 [2024-10-12 22:38:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:02,092 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2249 transitions. [2024-10-12 22:38:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 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:38:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2249 transitions. [2024-10-12 22:38:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 22:38:02,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:02,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 22:38:02,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:02,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash 83470718, now seen corresponding path program 1 times [2024-10-12 22:38:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455941664] [2024-10-12 22:38:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:02,964 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:38:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455941664] [2024-10-12 22:38:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455941664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317425315] [2024-10-12 22:38:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:02,968 INFO L87 Difference]: Start difference. First operand 1512 states and 2249 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 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:38:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:03,538 INFO L93 Difference]: Finished difference Result 2731 states and 4059 transitions. [2024-10-12 22:38:03,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:03,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 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 353 [2024-10-12 22:38:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:03,548 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:03,549 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:03,553 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:38:03,554 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4187 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:03,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 3858 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4877239548772396) internal successors, (2242), 1507 states have internal predecessors, (2242), 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:38:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2248 transitions. [2024-10-12 22:38:03,582 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2248 transitions. Word has length 353 [2024-10-12 22:38:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:03,583 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2248 transitions. [2024-10-12 22:38:03,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 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:38:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2248 transitions. [2024-10-12 22:38:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-12 22:38:03,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 22:38:03,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:03,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1209224498, now seen corresponding path program 1 times [2024-10-12 22:38:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467544104] [2024-10-12 22:38:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:04,355 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:38:04,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467544104] [2024-10-12 22:38:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467544104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83625092] [2024-10-12 22:38:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:04,359 INFO L87 Difference]: Start difference. First operand 1512 states and 2248 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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:38:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:04,907 INFO L93 Difference]: Finished difference Result 2731 states and 4057 transitions. [2024-10-12 22:38:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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 354 [2024-10-12 22:38:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:04,915 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:04,915 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:04,917 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:38:04,918 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4179 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4182 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:04,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4182 Valid, 3858 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4870603848706039) internal successors, (2241), 1507 states have internal predecessors, (2241), 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:38:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2247 transitions. [2024-10-12 22:38:04,944 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2247 transitions. Word has length 354 [2024-10-12 22:38:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:04,945 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2247 transitions. [2024-10-12 22:38:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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:38:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2247 transitions. [2024-10-12 22:38:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-12 22:38:04,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:04,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 22:38:04,948 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash 298095269, now seen corresponding path program 1 times [2024-10-12 22:38:04,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:04,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510733079] [2024-10-12 22:38:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:05,726 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:38:05,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:05,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510733079] [2024-10-12 22:38:05,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510733079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:05,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:05,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742572490] [2024-10-12 22:38:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:05,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:05,729 INFO L87 Difference]: Start difference. First operand 1512 states and 2247 transitions. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:38:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:06,303 INFO L93 Difference]: Finished difference Result 2731 states and 4055 transitions. [2024-10-12 22:38:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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 355 [2024-10-12 22:38:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:06,317 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:06,318 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:06,320 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:38:06,321 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4171 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4174 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:06,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4174 Valid, 3858 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4863968148639681) internal successors, (2240), 1507 states have internal predecessors, (2240), 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:38:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2246 transitions. [2024-10-12 22:38:06,349 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2246 transitions. Word has length 355 [2024-10-12 22:38:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2246 transitions. [2024-10-12 22:38:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 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:38:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2246 transitions. [2024-10-12 22:38:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-12 22:38:06,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:06,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 22:38:06,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1749871609, now seen corresponding path program 1 times [2024-10-12 22:38:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958796022] [2024-10-12 22:38:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:07,090 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:38:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958796022] [2024-10-12 22:38:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958796022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327595927] [2024-10-12 22:38:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:07,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:07,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:07,094 INFO L87 Difference]: Start difference. First operand 1512 states and 2246 transitions. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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:38:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:07,614 INFO L93 Difference]: Finished difference Result 2731 states and 4053 transitions. [2024-10-12 22:38:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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 356 [2024-10-12 22:38:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:07,618 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:07,619 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:07,620 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:38:07,621 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2210 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 3864 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:07,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 3864 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4857332448573324) internal successors, (2239), 1507 states have internal predecessors, (2239), 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:38:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2245 transitions. [2024-10-12 22:38:07,644 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2245 transitions. Word has length 356 [2024-10-12 22:38:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:07,645 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2245 transitions. [2024-10-12 22:38:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 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:38:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2245 transitions. [2024-10-12 22:38:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-12 22:38:07,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:07,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 22:38:07,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 828349260, now seen corresponding path program 1 times [2024-10-12 22:38:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061438879] [2024-10-12 22:38:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:07,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:08,389 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:38:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061438879] [2024-10-12 22:38:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061438879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716254166] [2024-10-12 22:38:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:08,391 INFO L87 Difference]: Start difference. First operand 1512 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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:38:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:08,893 INFO L93 Difference]: Finished difference Result 2731 states and 4051 transitions. [2024-10-12 22:38:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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 357 [2024-10-12 22:38:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:08,897 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:08,897 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:08,899 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:38:08,900 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4155 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4158 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:08,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4158 Valid, 3858 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4850696748506969) internal successors, (2238), 1507 states have internal predecessors, (2238), 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:38:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2244 transitions. [2024-10-12 22:38:08,927 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2244 transitions. Word has length 357 [2024-10-12 22:38:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:08,928 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2244 transitions. [2024-10-12 22:38:08,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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:38:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2244 transitions. [2024-10-12 22:38:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-12 22:38:08,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:08,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 22:38:08,931 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2014450240, now seen corresponding path program 1 times [2024-10-12 22:38:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148128931] [2024-10-12 22:38:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:09,793 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:38:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148128931] [2024-10-12 22:38:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148128931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:09,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:09,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554319923] [2024-10-12 22:38:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:09,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:09,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:09,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:09,796 INFO L87 Difference]: Start difference. First operand 1512 states and 2244 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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:38:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:10,248 INFO L93 Difference]: Finished difference Result 2731 states and 4049 transitions. [2024-10-12 22:38:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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 358 [2024-10-12 22:38:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:10,252 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:10,252 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:10,254 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:38:10,254 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4147 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:10,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4150 Valid, 3858 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.484406104844061) internal successors, (2237), 1507 states have internal predecessors, (2237), 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:38:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2243 transitions. [2024-10-12 22:38:10,276 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2243 transitions. Word has length 358 [2024-10-12 22:38:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:10,276 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2243 transitions. [2024-10-12 22:38:10,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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:38:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2243 transitions. [2024-10-12 22:38:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-12 22:38:10,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:10,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 22:38:10,280 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:10,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash -877034637, now seen corresponding path program 1 times [2024-10-12 22:38:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:10,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431408439] [2024-10-12 22:38:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:10,972 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:38:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431408439] [2024-10-12 22:38:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431408439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145726193] [2024-10-12 22:38:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:10,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:10,974 INFO L87 Difference]: Start difference. First operand 1512 states and 2243 transitions. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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:38:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:11,425 INFO L93 Difference]: Finished difference Result 2731 states and 4047 transitions. [2024-10-12 22:38:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:11,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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 359 [2024-10-12 22:38:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:11,429 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:11,429 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:11,431 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:38:11,432 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4139 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:11,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 3858 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4837425348374254) internal successors, (2236), 1507 states have internal predecessors, (2236), 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:38:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2242 transitions. [2024-10-12 22:38:11,459 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2242 transitions. Word has length 359 [2024-10-12 22:38:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2242 transitions. [2024-10-12 22:38:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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:38:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2242 transitions. [2024-10-12 22:38:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-12 22:38:11,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:11,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 22:38:11,463 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1673494535, now seen corresponding path program 1 times [2024-10-12 22:38:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203034443] [2024-10-12 22:38:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:12,114 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:38:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:12,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203034443] [2024-10-12 22:38:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203034443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366151401] [2024-10-12 22:38:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:12,117 INFO L87 Difference]: Start difference. First operand 1512 states and 2242 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:38:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:12,536 INFO L93 Difference]: Finished difference Result 2731 states and 4045 transitions. [2024-10-12 22:38:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 360 [2024-10-12 22:38:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:12,541 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:12,541 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:12,543 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:38:12,544 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2194 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:12,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 3864 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4830789648307896) internal successors, (2235), 1507 states have internal predecessors, (2235), 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:38:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2241 transitions. [2024-10-12 22:38:12,567 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2241 transitions. Word has length 360 [2024-10-12 22:38:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:12,568 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2241 transitions. [2024-10-12 22:38:12,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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:38:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2241 transitions. [2024-10-12 22:38:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-12 22:38:12,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:12,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 22:38:12,571 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -580842726, now seen corresponding path program 1 times [2024-10-12 22:38:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674838519] [2024-10-12 22:38:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:13,233 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:38:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674838519] [2024-10-12 22:38:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674838519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725227837] [2024-10-12 22:38:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:13,235 INFO L87 Difference]: Start difference. First operand 1512 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:38:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:13,651 INFO L93 Difference]: Finished difference Result 2731 states and 4043 transitions. [2024-10-12 22:38:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:13,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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 361 [2024-10-12 22:38:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:13,655 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:13,655 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:13,656 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:38:13,657 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2190 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:13,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3864 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4824153948241539) internal successors, (2234), 1507 states have internal predecessors, (2234), 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:38:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2240 transitions. [2024-10-12 22:38:13,678 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2240 transitions. Word has length 361 [2024-10-12 22:38:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2240 transitions. [2024-10-12 22:38:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:38:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2240 transitions. [2024-10-12 22:38:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-12 22:38:13,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:13,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 22:38:13,682 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:13,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1557263694, now seen corresponding path program 1 times [2024-10-12 22:38:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907475776] [2024-10-12 22:38:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:14,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:14,306 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:38:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907475776] [2024-10-12 22:38:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907475776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828887378] [2024-10-12 22:38:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:14,308 INFO L87 Difference]: Start difference. First operand 1512 states and 2240 transitions. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 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:38:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:14,757 INFO L93 Difference]: Finished difference Result 2731 states and 4041 transitions. [2024-10-12 22:38:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 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 362 [2024-10-12 22:38:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:14,760 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:14,760 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:14,762 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:38:14,762 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4115 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4118 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:14,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4118 Valid, 3858 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4817518248175183) internal successors, (2233), 1507 states have internal predecessors, (2233), 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:38:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2239 transitions. [2024-10-12 22:38:14,789 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2239 transitions. Word has length 362 [2024-10-12 22:38:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:14,789 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2239 transitions. [2024-10-12 22:38:14,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 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:38:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2239 transitions. [2024-10-12 22:38:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-12 22:38:14,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:14,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 22:38:14,792 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2005201473, now seen corresponding path program 1 times [2024-10-12 22:38:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222813241] [2024-10-12 22:38:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:15,466 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:38:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222813241] [2024-10-12 22:38:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222813241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:15,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502002738] [2024-10-12 22:38:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:15,469 INFO L87 Difference]: Start difference. First operand 1512 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 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:38:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:15,860 INFO L93 Difference]: Finished difference Result 2731 states and 4039 transitions. [2024-10-12 22:38:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 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 363 [2024-10-12 22:38:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:15,865 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:15,865 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:15,866 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:38:15,867 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4107 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4110 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:15,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4110 Valid, 3858 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4810882548108826) internal successors, (2232), 1507 states have internal predecessors, (2232), 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:38:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2238 transitions. [2024-10-12 22:38:15,889 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2238 transitions. Word has length 363 [2024-10-12 22:38:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:15,890 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2238 transitions. [2024-10-12 22:38:15,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 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:38:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2238 transitions. [2024-10-12 22:38:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-10-12 22:38:15,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:15,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 22:38:15,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash 971387413, now seen corresponding path program 1 times [2024-10-12 22:38:15,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:15,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744522212] [2024-10-12 22:38:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:16,644 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:38:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:16,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744522212] [2024-10-12 22:38:16,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744522212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772151169] [2024-10-12 22:38:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:16,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:16,647 INFO L87 Difference]: Start difference. First operand 1512 states and 2238 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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:38:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:17,095 INFO L93 Difference]: Finished difference Result 2731 states and 4037 transitions. [2024-10-12 22:38:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:17,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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 364 [2024-10-12 22:38:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:17,098 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:17,098 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:17,100 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:38:17,100 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4099 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4102 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:17,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4102 Valid, 3858 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4804246848042468) internal successors, (2231), 1507 states have internal predecessors, (2231), 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:38:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2237 transitions. [2024-10-12 22:38:17,119 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2237 transitions. Word has length 364 [2024-10-12 22:38:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:17,119 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2237 transitions. [2024-10-12 22:38:17,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 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:38:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2237 transitions. [2024-10-12 22:38:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-12 22:38:17,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:17,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 22:38:17,122 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1072953576, now seen corresponding path program 1 times [2024-10-12 22:38:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230603670] [2024-10-12 22:38:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:17,865 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:38:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230603670] [2024-10-12 22:38:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230603670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844421904] [2024-10-12 22:38:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:17,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:17,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:17,868 INFO L87 Difference]: Start difference. First operand 1512 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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:38:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:18,374 INFO L93 Difference]: Finished difference Result 2731 states and 4035 transitions. [2024-10-12 22:38:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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 365 [2024-10-12 22:38:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:18,378 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:18,378 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:18,379 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:38:18,380 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2174 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:18,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 3864 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.479761114797611) internal successors, (2230), 1507 states have internal predecessors, (2230), 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:38:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2236 transitions. [2024-10-12 22:38:18,404 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2236 transitions. Word has length 365 [2024-10-12 22:38:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:18,404 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2236 transitions. [2024-10-12 22:38:18,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 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:38:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2236 transitions. [2024-10-12 22:38:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-12 22:38:18,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:18,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 22:38:18,408 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:18,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -692521380, now seen corresponding path program 1 times [2024-10-12 22:38:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965917035] [2024-10-12 22:38:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:19,031 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:38:19,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:19,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965917035] [2024-10-12 22:38:19,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965917035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:19,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184917817] [2024-10-12 22:38:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:19,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:19,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:19,034 INFO L87 Difference]: Start difference. First operand 1512 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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:38:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:19,465 INFO L93 Difference]: Finished difference Result 2731 states and 4033 transitions. [2024-10-12 22:38:19,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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 366 [2024-10-12 22:38:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:19,469 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:19,469 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:19,471 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:38:19,472 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2170 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:19,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 3864 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4790975447909755) internal successors, (2229), 1507 states have internal predecessors, (2229), 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:38:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2235 transitions. [2024-10-12 22:38:19,494 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2235 transitions. Word has length 366 [2024-10-12 22:38:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:19,495 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2235 transitions. [2024-10-12 22:38:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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:38:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2235 transitions. [2024-10-12 22:38:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-12 22:38:19,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:19,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 22:38:19,499 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash -249766129, now seen corresponding path program 1 times [2024-10-12 22:38:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:19,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931327895] [2024-10-12 22:38:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:20,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:20,435 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:38:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931327895] [2024-10-12 22:38:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931327895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422252539] [2024-10-12 22:38:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:20,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:20,438 INFO L87 Difference]: Start difference. First operand 1512 states and 2235 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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:38:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:20,927 INFO L93 Difference]: Finished difference Result 2731 states and 4031 transitions. [2024-10-12 22:38:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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 367 [2024-10-12 22:38:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:20,930 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:20,930 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:20,931 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:38:20,932 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2166 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:20,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 3864 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4784339747843398) internal successors, (2228), 1507 states have internal predecessors, (2228), 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:38:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2234 transitions. [2024-10-12 22:38:20,959 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2234 transitions. Word has length 367 [2024-10-12 22:38:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2234 transitions. [2024-10-12 22:38:20,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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:38:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2234 transitions. [2024-10-12 22:38:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-10-12 22:38:20,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 22:38:20,965 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:20,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1948713507, now seen corresponding path program 1 times [2024-10-12 22:38:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:20,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193984097] [2024-10-12 22:38:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:21,577 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:38:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193984097] [2024-10-12 22:38:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193984097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108786261] [2024-10-12 22:38:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:21,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:21,579 INFO L87 Difference]: Start difference. First operand 1512 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 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:38:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:21,966 INFO L93 Difference]: Finished difference Result 2731 states and 4029 transitions. [2024-10-12 22:38:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 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 368 [2024-10-12 22:38:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:21,971 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:21,971 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:21,973 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:38:21,974 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2162 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:21,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 3864 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.477770404777704) internal successors, (2227), 1507 states have internal predecessors, (2227), 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:38:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2233 transitions. [2024-10-12 22:38:21,994 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2233 transitions. Word has length 368 [2024-10-12 22:38:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2233 transitions. [2024-10-12 22:38:21,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 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:38:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2233 transitions. [2024-10-12 22:38:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-10-12 22:38:21,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:21,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 22:38:21,997 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -636590922, now seen corresponding path program 1 times [2024-10-12 22:38:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854551326] [2024-10-12 22:38:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:22,636 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:38:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854551326] [2024-10-12 22:38:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854551326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143772394] [2024-10-12 22:38:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:22,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:22,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:22,638 INFO L87 Difference]: Start difference. First operand 1512 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 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:38:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:23,026 INFO L93 Difference]: Finished difference Result 2731 states and 4027 transitions. [2024-10-12 22:38:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:23,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 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 369 [2024-10-12 22:38:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:23,028 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:23,028 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:23,029 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:38:23,030 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2158 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:23,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 3864 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4771068347710683) internal successors, (2226), 1507 states have internal predecessors, (2226), 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:38:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2232 transitions. [2024-10-12 22:38:23,042 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2232 transitions. Word has length 369 [2024-10-12 22:38:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:23,043 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2232 transitions. [2024-10-12 22:38:23,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 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:38:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2232 transitions. [2024-10-12 22:38:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-12 22:38:23,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:23,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 22:38:23,045 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 405607786, now seen corresponding path program 1 times [2024-10-12 22:38:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246841903] [2024-10-12 22:38:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:23,669 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:38:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246841903] [2024-10-12 22:38:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246841903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779448937] [2024-10-12 22:38:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:23,671 INFO L87 Difference]: Start difference. First operand 1512 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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:38:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:24,051 INFO L93 Difference]: Finished difference Result 2731 states and 4025 transitions. [2024-10-12 22:38:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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 370 [2024-10-12 22:38:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:24,055 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:24,055 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:24,057 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:38:24,057 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4051 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:24,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 3858 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4764432647644326) internal successors, (2225), 1507 states have internal predecessors, (2225), 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:38:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2231 transitions. [2024-10-12 22:38:24,079 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2231 transitions. Word has length 370 [2024-10-12 22:38:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2231 transitions. [2024-10-12 22:38:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 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:38:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2231 transitions. [2024-10-12 22:38:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-10-12 22:38:24,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:24,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 22:38:24,083 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1584875997, now seen corresponding path program 1 times [2024-10-12 22:38:24,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:24,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874055435] [2024-10-12 22:38:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:24,771 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:38:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874055435] [2024-10-12 22:38:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874055435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:24,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14346974] [2024-10-12 22:38:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:24,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:24,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:24,775 INFO L87 Difference]: Start difference. First operand 1512 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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:38:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:25,282 INFO L93 Difference]: Finished difference Result 2731 states and 4023 transitions. [2024-10-12 22:38:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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 371 [2024-10-12 22:38:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:25,285 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:25,285 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:25,287 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:38:25,288 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2150 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:25,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 3864 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.475779694757797) internal successors, (2224), 1507 states have internal predecessors, (2224), 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:38:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2230 transitions. [2024-10-12 22:38:25,308 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2230 transitions. Word has length 371 [2024-10-12 22:38:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:25,309 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2230 transitions. [2024-10-12 22:38:25,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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:38:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2230 transitions. [2024-10-12 22:38:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-12 22:38:25,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:25,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 22:38:25,312 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:25,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash -303566799, now seen corresponding path program 1 times [2024-10-12 22:38:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:25,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704425121] [2024-10-12 22:38:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:25,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:25,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:26,000 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:38:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704425121] [2024-10-12 22:38:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704425121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:26,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:26,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928476318] [2024-10-12 22:38:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:26,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:26,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:26,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:26,003 INFO L87 Difference]: Start difference. First operand 1512 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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:38:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:26,497 INFO L93 Difference]: Finished difference Result 2731 states and 4021 transitions. [2024-10-12 22:38:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 372 [2024-10-12 22:38:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:26,501 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:26,501 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:26,503 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:38:26,503 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2146 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:26,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 3864 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 22:38:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4751161247511613) internal successors, (2223), 1507 states have internal predecessors, (2223), 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:38:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2229 transitions. [2024-10-12 22:38:26,522 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2229 transitions. Word has length 372 [2024-10-12 22:38:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:26,523 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2229 transitions. [2024-10-12 22:38:26,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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:38:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2229 transitions. [2024-10-12 22:38:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-10-12 22:38:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:26,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 22:38:26,526 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1990610564, now seen corresponding path program 1 times [2024-10-12 22:38:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755551511] [2024-10-12 22:38:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:27,058 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:38:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755551511] [2024-10-12 22:38:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755551511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:27,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:27,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204419218] [2024-10-12 22:38:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:27,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:27,060 INFO L87 Difference]: Start difference. First operand 1512 states and 2229 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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:38:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:27,492 INFO L93 Difference]: Finished difference Result 2731 states and 4019 transitions. [2024-10-12 22:38:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:27,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 373 [2024-10-12 22:38:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:27,495 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:27,495 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:27,496 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:38:27,496 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 2142 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 3864 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:27,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 3864 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 22:38:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4744525547445255) internal successors, (2222), 1507 states have internal predecessors, (2222), 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:38:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2228 transitions. [2024-10-12 22:38:27,516 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2228 transitions. Word has length 373 [2024-10-12 22:38:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:27,516 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2228 transitions. [2024-10-12 22:38:27,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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:38:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2228 transitions. [2024-10-12 22:38:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-10-12 22:38:27,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:27,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 22:38:27,520 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1517006216, now seen corresponding path program 1 times [2024-10-12 22:38:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764309035] [2024-10-12 22:38:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:38:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 22:38:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 22:38:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-12 22:38:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:38:28,223 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:38:28,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:38:28,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764309035] [2024-10-12 22:38:28,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764309035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:38:28,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:38:28,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:38:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817656153] [2024-10-12 22:38:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:38:28,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:38:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:38:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:38:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:38:28,226 INFO L87 Difference]: Start difference. First operand 1512 states and 2228 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:38:28,600 INFO L93 Difference]: Finished difference Result 2731 states and 4017 transitions. [2024-10-12 22:38:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:38:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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 374 [2024-10-12 22:38:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:38:28,603 INFO L225 Difference]: With dead ends: 2731 [2024-10-12 22:38:28,603 INFO L226 Difference]: Without dead ends: 1512 [2024-10-12 22:38:28,605 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:38:28,605 INFO L432 NwaCegarLoop]: 1928 mSDtfsCounter, 4019 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4022 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:38:28,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4022 Valid, 3858 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:38:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-12 22:38:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-10-12 22:38:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1507 states have (on average 1.4737889847378898) internal successors, (2221), 1507 states have internal predecessors, (2221), 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:38:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2227 transitions. [2024-10-12 22:38:28,628 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2227 transitions. Word has length 374 [2024-10-12 22:38:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:38:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2227 transitions. [2024-10-12 22:38:28,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:38:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2227 transitions. [2024-10-12 22:38:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-10-12 22:38:28,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:38:28,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 22:38:28,632 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:38:28,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:38:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 797586091, now seen corresponding path program 1 times [2024-10-12 22:38:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:38:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686190136] [2024-10-12 22:38:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:38:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms