./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_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 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:49:56,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:49:56,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:49:56,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:49:56,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:49:56,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:49:56,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:49:56,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:49:56,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:49:56,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:49:56,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:49:56,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:49:56,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:49:56,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:49:56,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:49:56,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:49:56,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:49:56,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:49:56,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:49:56,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:49:56,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:49:56,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:49:56,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:49:56,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:49:56,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:49:56,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:49:56,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:49:56,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:49:56,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:49:56,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:49:56,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:49:56,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:49:56,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:49:56,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:49:56,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:49:56,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:49:56,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:49:56,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:49:56,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:49:56,366 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 -> 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 [2024-11-11 23:49:56,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:49:56,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:49:56,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:49:56,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:49:56,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:49:56,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-11 23:49:58,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:49:58,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:49:58,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-11 23:49:58,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4022a2cb/e01a0b2b3fd44ee68f03b7daa5037761/FLAG929905c13 [2024-11-11 23:49:58,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4022a2cb/e01a0b2b3fd44ee68f03b7daa5037761 [2024-11-11 23:49:58,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:49:58,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:49:58,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:49:58,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:49:58,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:49:58,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:49:58" (1/1) ... [2024-11-11 23:49:58,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557bbfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:58, skipping insertion in model container [2024-11-11 23:49:58,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:49:58" (1/1) ... [2024-11-11 23:49:58,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:49:58,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-11-11 23:49:59,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:49:59,294 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:49:59,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2024-11-11 23:49:59,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:49:59,511 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:49:59,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59 WrapperNode [2024-11-11 23:49:59,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:49:59,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:49:59,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:49:59,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:49:59,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:49:59,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:49:59,894 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3163 [2024-11-11 23:49:59,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:49:59,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:49:59,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:49:59,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:49:59,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:49:59,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:49:59,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,089 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-11-11 23:50:00,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:50:00,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:50:00,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:50:00,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:50:00,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (1/1) ... [2024-11-11 23:50:00,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:50:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:50:00,371 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-11-11 23:50:00,380 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-11-11 23:50:00,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:50:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 23:50:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 23:50:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:50:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:50:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:50:01,013 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:50:01,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:50:04,495 INFO L? ?]: Removed 1764 outVars from TransFormulas that were not future-live. [2024-11-11 23:50:04,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:50:04,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:50:04,538 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:50:04,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:50:04 BoogieIcfgContainer [2024-11-11 23:50:04,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:50:04,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:50:04,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:50:04,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:50:04,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:49:58" (1/3) ... [2024-11-11 23:50:04,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401287c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:50:04, skipping insertion in model container [2024-11-11 23:50:04,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:49:59" (2/3) ... [2024-11-11 23:50:04,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401287c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:50:04, skipping insertion in model container [2024-11-11 23:50:04,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:50:04" (3/3) ... [2024-11-11 23:50:04,547 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2024-11-11 23:50:04,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:50:04,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:50:04,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:50:04,657 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;@4fa0a1d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:50:04,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:50:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 866 states have (on average 1.4965357967667436) internal successors, (1296), 867 states have internal predecessors, (1296), 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-11-11 23:50:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-11 23:50:04,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:04,690 INFO L218 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] [2024-11-11 23:50:04,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:04,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2012975456, now seen corresponding path program 1 times [2024-11-11 23:50:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661299586] [2024-11-11 23:50:04,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:05,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661299586] [2024-11-11 23:50:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661299586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:05,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 23:50:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710052670] [2024-11-11 23:50:05,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:05,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 23:50:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 23:50:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 23:50:05,441 INFO L87 Difference]: Start difference. First operand has 872 states, 866 states have (on average 1.4965357967667436) internal successors, (1296), 867 states have internal predecessors, (1296), 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 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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-11-11 23:50:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:05,515 INFO L93 Difference]: Finished difference Result 1575 states and 2357 transitions. [2024-11-11 23:50:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 23:50:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 213 [2024-11-11 23:50:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:05,554 INFO L225 Difference]: With dead ends: 1575 [2024-11-11 23:50:05,554 INFO L226 Difference]: Without dead ends: 869 [2024-11-11 23:50:05,560 INFO L434 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-11-11 23:50:05,563 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:05,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-11 23:50:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-11 23:50:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 864 states have (on average 1.494212962962963) internal successors, (1291), 864 states have internal predecessors, (1291), 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-11-11 23:50:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1297 transitions. [2024-11-11 23:50:05,656 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1297 transitions. Word has length 213 [2024-11-11 23:50:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1297 transitions. [2024-11-11 23:50:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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-11-11 23:50:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1297 transitions. [2024-11-11 23:50:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-11 23:50:05,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:05,667 INFO L218 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] [2024-11-11 23:50:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:50:05,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1052899878, now seen corresponding path program 1 times [2024-11-11 23:50:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992400865] [2024-11-11 23:50:05,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992400865] [2024-11-11 23:50:07,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992400865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230340203] [2024-11-11 23:50:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:07,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:07,210 INFO L87 Difference]: Start difference. First operand 869 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-11-11 23:50:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:07,255 INFO L93 Difference]: Finished difference Result 873 states and 1301 transitions. [2024-11-11 23:50:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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 213 [2024-11-11 23:50:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:07,261 INFO L225 Difference]: With dead ends: 873 [2024-11-11 23:50:07,261 INFO L226 Difference]: Without dead ends: 871 [2024-11-11 23:50:07,262 INFO L434 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-11-11 23:50:07,263 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 0 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3879 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:07,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3879 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-11 23:50:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-11 23:50:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4930715935334873) internal successors, (1293), 866 states have internal predecessors, (1293), 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-11-11 23:50:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1299 transitions. [2024-11-11 23:50:07,289 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1299 transitions. Word has length 213 [2024-11-11 23:50:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:07,292 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1299 transitions. [2024-11-11 23:50:07,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-11-11 23:50:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1299 transitions. [2024-11-11 23:50:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-11 23:50:07,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:07,295 INFO L218 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] [2024-11-11 23:50:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:50:07,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1721538544, now seen corresponding path program 1 times [2024-11-11 23:50:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692149519] [2024-11-11 23:50:07,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:08,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:08,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692149519] [2024-11-11 23:50:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692149519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045261198] [2024-11-11 23:50:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:08,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:08,160 INFO L87 Difference]: Start difference. First operand 871 states and 1299 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-11-11 23:50:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:08,818 INFO L93 Difference]: Finished difference Result 2171 states and 3241 transitions. [2024-11-11 23:50:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:50:08,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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 214 [2024-11-11 23:50:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:08,823 INFO L225 Difference]: With dead ends: 2171 [2024-11-11 23:50:08,823 INFO L226 Difference]: Without dead ends: 871 [2024-11-11 23:50:08,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-11-11 23:50:08,826 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 2674 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:08,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 3679 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 23:50:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-11 23:50:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2024-11-11 23:50:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.491916859122402) internal successors, (1292), 866 states have internal predecessors, (1292), 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-11-11 23:50:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1298 transitions. [2024-11-11 23:50:08,849 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1298 transitions. Word has length 214 [2024-11-11 23:50:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1298 transitions. [2024-11-11 23:50:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 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-11-11 23:50:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1298 transitions. [2024-11-11 23:50:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-11 23:50:08,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:08,853 INFO L218 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] [2024-11-11 23:50:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:50:08,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1022974164, now seen corresponding path program 1 times [2024-11-11 23:50:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537135474] [2024-11-11 23:50:08,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537135474] [2024-11-11 23:50:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537135474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:09,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:09,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214553499] [2024-11-11 23:50:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:09,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:09,534 INFO L87 Difference]: Start difference. First operand 871 states and 1298 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-11-11 23:50:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:09,575 INFO L93 Difference]: Finished difference Result 1578 states and 2351 transitions. [2024-11-11 23:50:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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 215 [2024-11-11 23:50:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:09,580 INFO L225 Difference]: With dead ends: 1578 [2024-11-11 23:50:09,581 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:09,584 INFO L434 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-11-11 23:50:09,586 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 0 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:09,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3872 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4907834101382489) internal successors, (1294), 868 states have internal predecessors, (1294), 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-11-11 23:50:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1300 transitions. [2024-11-11 23:50:09,608 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1300 transitions. Word has length 215 [2024-11-11 23:50:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:09,610 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1300 transitions. [2024-11-11 23:50:09,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-11-11 23:50:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1300 transitions. [2024-11-11 23:50:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-11 23:50:09,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:09,613 INFO L218 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] [2024-11-11 23:50:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:50:09,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:09,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1549574583, now seen corresponding path program 1 times [2024-11-11 23:50:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275263133] [2024-11-11 23:50:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275263133] [2024-11-11 23:50:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275263133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58110516] [2024-11-11 23:50:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:10,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:10,468 INFO L87 Difference]: Start difference. First operand 873 states and 1300 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-11-11 23:50:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:10,663 INFO L93 Difference]: Finished difference Result 1580 states and 2352 transitions. [2024-11-11 23:50:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 216 [2024-11-11 23:50:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:10,668 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:10,668 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:10,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-11 23:50:10,670 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1144 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:10,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 2430 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.48963133640553) internal successors, (1293), 868 states have internal predecessors, (1293), 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-11-11 23:50:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1299 transitions. [2024-11-11 23:50:10,689 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1299 transitions. Word has length 216 [2024-11-11 23:50:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:10,690 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1299 transitions. [2024-11-11 23:50:10,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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-11-11 23:50:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1299 transitions. [2024-11-11 23:50:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 23:50:10,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:10,693 INFO L218 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] [2024-11-11 23:50:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 23:50:10,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:10,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1173048780, now seen corresponding path program 1 times [2024-11-11 23:50:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123108756] [2024-11-11 23:50:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123108756] [2024-11-11 23:50:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123108756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091558617] [2024-11-11 23:50:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:11,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:11,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:11,315 INFO L87 Difference]: Start difference. First operand 873 states and 1299 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-11-11 23:50:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:11,495 INFO L93 Difference]: Finished difference Result 1584 states and 2355 transitions. [2024-11-11 23:50:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:11,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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 217 [2024-11-11 23:50:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:11,500 INFO L225 Difference]: With dead ends: 1584 [2024-11-11 23:50:11,500 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:11,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-11 23:50:11,503 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 1151 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 3792 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:11,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 3792 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4884792626728112) internal successors, (1292), 868 states have internal predecessors, (1292), 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-11-11 23:50:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2024-11-11 23:50:11,532 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 217 [2024-11-11 23:50:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2024-11-11 23:50:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-11-11 23:50:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2024-11-11 23:50:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-11 23:50:11,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:11,536 INFO L218 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] [2024-11-11 23:50:11,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 23:50:11,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1642359753, now seen corresponding path program 1 times [2024-11-11 23:50:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179275799] [2024-11-11 23:50:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179275799] [2024-11-11 23:50:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179275799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245622260] [2024-11-11 23:50:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:12,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:12,217 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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-11-11 23:50:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:12,404 INFO L93 Difference]: Finished difference Result 1580 states and 2348 transitions. [2024-11-11 23:50:12,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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 218 [2024-11-11 23:50:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:12,408 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:12,409 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:12,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:12,411 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 2423 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2426 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:12,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2426 Valid, 2430 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.487327188940092) internal successors, (1291), 868 states have internal predecessors, (1291), 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-11-11 23:50:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1297 transitions. [2024-11-11 23:50:12,435 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1297 transitions. Word has length 218 [2024-11-11 23:50:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:12,436 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1297 transitions. [2024-11-11 23:50:12,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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-11-11 23:50:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1297 transitions. [2024-11-11 23:50:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-11 23:50:12,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:12,439 INFO L218 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] [2024-11-11 23:50:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 23:50:12,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1585766213, now seen corresponding path program 1 times [2024-11-11 23:50:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820563213] [2024-11-11 23:50:12,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820563213] [2024-11-11 23:50:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820563213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503503492] [2024-11-11 23:50:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:13,056 INFO L87 Difference]: Start difference. First operand 873 states and 1297 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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-11-11 23:50:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:13,240 INFO L93 Difference]: Finished difference Result 1580 states and 2346 transitions. [2024-11-11 23:50:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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 219 [2024-11-11 23:50:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:13,244 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:13,245 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:13,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:13,246 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 2409 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:13,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 2430 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4861751152073732) internal successors, (1290), 868 states have internal predecessors, (1290), 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-11-11 23:50:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1296 transitions. [2024-11-11 23:50:13,265 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1296 transitions. Word has length 219 [2024-11-11 23:50:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:13,266 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1296 transitions. [2024-11-11 23:50:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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-11-11 23:50:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1296 transitions. [2024-11-11 23:50:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-11 23:50:13,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:13,270 INFO L218 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] [2024-11-11 23:50:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 23:50:13,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 618447721, now seen corresponding path program 1 times [2024-11-11 23:50:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961851916] [2024-11-11 23:50:13,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961851916] [2024-11-11 23:50:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961851916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:13,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752785996] [2024-11-11 23:50:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:13,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:13,877 INFO L87 Difference]: Start difference. First operand 873 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-11-11 23:50:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:14,048 INFO L93 Difference]: Finished difference Result 1580 states and 2344 transitions. [2024-11-11 23:50:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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 220 [2024-11-11 23:50:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:14,053 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:14,054 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:14,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:14,056 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1271 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:14,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 2437 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4850230414746544) internal successors, (1289), 868 states have internal predecessors, (1289), 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-11-11 23:50:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1295 transitions. [2024-11-11 23:50:14,077 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1295 transitions. Word has length 220 [2024-11-11 23:50:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1295 transitions. [2024-11-11 23:50:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-11-11 23:50:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1295 transitions. [2024-11-11 23:50:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 23:50:14,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:14,080 INFO L218 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] [2024-11-11 23:50:14,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 23:50:14,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -453984140, now seen corresponding path program 1 times [2024-11-11 23:50:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957100218] [2024-11-11 23:50:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957100218] [2024-11-11 23:50:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957100218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927537167] [2024-11-11 23:50:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:14,652 INFO L87 Difference]: Start difference. First operand 873 states and 1295 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-11-11 23:50:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:14,832 INFO L93 Difference]: Finished difference Result 1580 states and 2342 transitions. [2024-11-11 23:50:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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 221 [2024-11-11 23:50:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:14,836 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:14,836 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:14,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:14,838 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 2393 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:14,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 2430 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4838709677419355) internal successors, (1288), 868 states have internal predecessors, (1288), 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-11-11 23:50:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1294 transitions. [2024-11-11 23:50:14,856 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1294 transitions. Word has length 221 [2024-11-11 23:50:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:14,857 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1294 transitions. [2024-11-11 23:50:14,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-11-11 23:50:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1294 transitions. [2024-11-11 23:50:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-11 23:50:14,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:14,859 INFO L218 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] [2024-11-11 23:50:14,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 23:50:14,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:14,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -64366334, now seen corresponding path program 1 times [2024-11-11 23:50:14,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:14,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278247747] [2024-11-11 23:50:14,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278247747] [2024-11-11 23:50:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278247747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413950633] [2024-11-11 23:50:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:15,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:15,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:15,381 INFO L87 Difference]: Start difference. First operand 873 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-11-11 23:50:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:15,620 INFO L93 Difference]: Finished difference Result 1580 states and 2340 transitions. [2024-11-11 23:50:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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 222 [2024-11-11 23:50:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:15,624 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:15,624 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:15,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:15,626 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 2385 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:15,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 2430 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4827188940092166) internal successors, (1287), 868 states have internal predecessors, (1287), 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-11-11 23:50:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1293 transitions. [2024-11-11 23:50:15,644 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1293 transitions. Word has length 222 [2024-11-11 23:50:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1293 transitions. [2024-11-11 23:50:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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-11-11 23:50:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1293 transitions. [2024-11-11 23:50:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-11 23:50:15,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:15,647 INFO L218 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] [2024-11-11 23:50:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 23:50:15,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash 468910253, now seen corresponding path program 1 times [2024-11-11 23:50:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842021200] [2024-11-11 23:50:15,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842021200] [2024-11-11 23:50:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842021200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357611315] [2024-11-11 23:50:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:16,177 INFO L87 Difference]: Start difference. First operand 873 states and 1293 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-11 23:50:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:16,355 INFO L93 Difference]: Finished difference Result 1580 states and 2338 transitions. [2024-11-11 23:50:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 223 [2024-11-11 23:50:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:16,360 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:16,360 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:16,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:16,362 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1259 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:16,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 2437 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4815668202764978) internal successors, (1286), 868 states have internal predecessors, (1286), 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-11-11 23:50:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1292 transitions. [2024-11-11 23:50:16,381 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1292 transitions. Word has length 223 [2024-11-11 23:50:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1292 transitions. [2024-11-11 23:50:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-11 23:50:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1292 transitions. [2024-11-11 23:50:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-11 23:50:16,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:16,384 INFO L218 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] [2024-11-11 23:50:16,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 23:50:16,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:16,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 32065307, now seen corresponding path program 1 times [2024-11-11 23:50:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916719440] [2024-11-11 23:50:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916719440] [2024-11-11 23:50:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916719440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219661922] [2024-11-11 23:50:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:17,196 INFO L87 Difference]: Start difference. First operand 873 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-11-11 23:50:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:17,335 INFO L93 Difference]: Finished difference Result 1580 states and 2336 transitions. [2024-11-11 23:50:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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 224 [2024-11-11 23:50:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:17,339 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:17,340 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:17,341 INFO L434 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-11-11 23:50:17,342 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 1142 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:17,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 2494 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4804147465437787) internal successors, (1285), 868 states have internal predecessors, (1285), 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-11-11 23:50:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1291 transitions. [2024-11-11 23:50:17,364 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1291 transitions. Word has length 224 [2024-11-11 23:50:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:17,364 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1291 transitions. [2024-11-11 23:50:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-11-11 23:50:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1291 transitions. [2024-11-11 23:50:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 23:50:17,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:17,368 INFO L218 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] [2024-11-11 23:50:17,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 23:50:17,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash -672246803, now seen corresponding path program 1 times [2024-11-11 23:50:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673245053] [2024-11-11 23:50:17,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:17,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673245053] [2024-11-11 23:50:17,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673245053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:17,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:17,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836726128] [2024-11-11 23:50:17,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:17,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:17,950 INFO L87 Difference]: Start difference. First operand 873 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-11-11 23:50:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:18,059 INFO L93 Difference]: Finished difference Result 1586 states and 2342 transitions. [2024-11-11 23:50:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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 225 [2024-11-11 23:50:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:18,064 INFO L225 Difference]: With dead ends: 1586 [2024-11-11 23:50:18,064 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:18,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-11 23:50:18,066 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 1153 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:18,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 3806 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4792626728110598) internal successors, (1284), 868 states have internal predecessors, (1284), 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-11-11 23:50:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1290 transitions. [2024-11-11 23:50:18,086 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1290 transitions. Word has length 225 [2024-11-11 23:50:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:18,087 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1290 transitions. [2024-11-11 23:50:18,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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-11-11 23:50:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1290 transitions. [2024-11-11 23:50:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-11 23:50:18,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:18,090 INFO L218 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] [2024-11-11 23:50:18,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 23:50:18,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 341302886, now seen corresponding path program 1 times [2024-11-11 23:50:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695015842] [2024-11-11 23:50:18,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695015842] [2024-11-11 23:50:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695015842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237523874] [2024-11-11 23:50:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:18,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:18,609 INFO L87 Difference]: Start difference. First operand 873 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-11-11 23:50:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:18,755 INFO L93 Difference]: Finished difference Result 1580 states and 2332 transitions. [2024-11-11 23:50:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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 226 [2024-11-11 23:50:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:18,759 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:18,759 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:18,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:18,761 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 2415 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:18,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2418 Valid, 2494 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.478110599078341) internal successors, (1283), 868 states have internal predecessors, (1283), 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-11-11 23:50:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1289 transitions. [2024-11-11 23:50:18,778 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1289 transitions. Word has length 226 [2024-11-11 23:50:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:18,779 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1289 transitions. [2024-11-11 23:50:18,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-11-11 23:50:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1289 transitions. [2024-11-11 23:50:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-11 23:50:18,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:18,782 INFO L218 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] [2024-11-11 23:50:18,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 23:50:18,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:18,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2080362252, now seen corresponding path program 1 times [2024-11-11 23:50:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:18,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808632909] [2024-11-11 23:50:18,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808632909] [2024-11-11 23:50:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808632909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947697097] [2024-11-11 23:50:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:19,269 INFO L87 Difference]: Start difference. First operand 873 states and 1289 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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-11-11 23:50:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:19,390 INFO L93 Difference]: Finished difference Result 1580 states and 2330 transitions. [2024-11-11 23:50:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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 227 [2024-11-11 23:50:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:19,396 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:19,396 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:19,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:19,398 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 2407 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:19,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 2494 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.476958525345622) internal successors, (1282), 868 states have internal predecessors, (1282), 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-11-11 23:50:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1288 transitions. [2024-11-11 23:50:19,418 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1288 transitions. Word has length 227 [2024-11-11 23:50:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1288 transitions. [2024-11-11 23:50:19,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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-11-11 23:50:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1288 transitions. [2024-11-11 23:50:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-11 23:50:19,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:19,422 INFO L218 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] [2024-11-11 23:50:19,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 23:50:19,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:19,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -284488755, now seen corresponding path program 1 times [2024-11-11 23:50:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789827691] [2024-11-11 23:50:19,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789827691] [2024-11-11 23:50:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789827691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061685280] [2024-11-11 23:50:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:20,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:20,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:20,209 INFO L87 Difference]: Start difference. First operand 873 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-11-11 23:50:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:20,539 INFO L93 Difference]: Finished difference Result 1580 states and 2328 transitions. [2024-11-11 23:50:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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 228 [2024-11-11 23:50:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:20,543 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:20,544 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:20,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-11 23:50:20,546 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 1088 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:20,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2246 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4758064516129032) internal successors, (1281), 868 states have internal predecessors, (1281), 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-11-11 23:50:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1287 transitions. [2024-11-11 23:50:20,570 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1287 transitions. Word has length 228 [2024-11-11 23:50:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:20,570 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1287 transitions. [2024-11-11 23:50:20,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-11-11 23:50:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1287 transitions. [2024-11-11 23:50:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-11 23:50:20,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:20,572 INFO L218 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] [2024-11-11 23:50:20,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 23:50:20,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1945228398, now seen corresponding path program 1 times [2024-11-11 23:50:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:20,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729338211] [2024-11-11 23:50:20,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:21,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729338211] [2024-11-11 23:50:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729338211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:21,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27611035] [2024-11-11 23:50:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:21,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:21,123 INFO L87 Difference]: Start difference. First operand 873 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-11-11 23:50:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:21,409 INFO L93 Difference]: Finished difference Result 1600 states and 2355 transitions. [2024-11-11 23:50:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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 229 [2024-11-11 23:50:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:21,414 INFO L225 Difference]: With dead ends: 1600 [2024-11-11 23:50:21,414 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:21,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-11 23:50:21,417 INFO L435 NwaCegarLoop]: 1267 mSDtfsCounter, 1127 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:21,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 3660 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4746543778801844) internal successors, (1280), 868 states have internal predecessors, (1280), 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-11-11 23:50:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1286 transitions. [2024-11-11 23:50:21,437 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1286 transitions. Word has length 229 [2024-11-11 23:50:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:21,438 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1286 transitions. [2024-11-11 23:50:21,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-11-11 23:50:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1286 transitions. [2024-11-11 23:50:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-11 23:50:21,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:21,440 INFO L218 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] [2024-11-11 23:50:21,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 23:50:21,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1503407577, now seen corresponding path program 1 times [2024-11-11 23:50:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258644515] [2024-11-11 23:50:21,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258644515] [2024-11-11 23:50:21,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258644515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:21,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:21,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544589925] [2024-11-11 23:50:21,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:21,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:21,970 INFO L87 Difference]: Start difference. First operand 873 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 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-11-11 23:50:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:22,303 INFO L93 Difference]: Finished difference Result 1580 states and 2324 transitions. [2024-11-11 23:50:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 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 230 [2024-11-11 23:50:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:22,308 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:22,308 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:22,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:22,310 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2371 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:22,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2246 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4735023041474655) internal successors, (1279), 868 states have internal predecessors, (1279), 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-11-11 23:50:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1285 transitions. [2024-11-11 23:50:22,333 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1285 transitions. Word has length 230 [2024-11-11 23:50:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:22,334 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1285 transitions. [2024-11-11 23:50:22,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 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-11-11 23:50:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1285 transitions. [2024-11-11 23:50:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-11 23:50:22,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:22,336 INFO L218 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] [2024-11-11 23:50:22,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 23:50:22,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1655999115, now seen corresponding path program 1 times [2024-11-11 23:50:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237940229] [2024-11-11 23:50:22,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237940229] [2024-11-11 23:50:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237940229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10553952] [2024-11-11 23:50:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:22,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:22,944 INFO L87 Difference]: Start difference. First operand 873 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-11 23:50:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:23,259 INFO L93 Difference]: Finished difference Result 1580 states and 2322 transitions. [2024-11-11 23:50:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:23,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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 231 [2024-11-11 23:50:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:23,264 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:23,264 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:23,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:23,266 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2363 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:23,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 2246 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4723502304147464) internal successors, (1278), 868 states have internal predecessors, (1278), 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-11-11 23:50:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1284 transitions. [2024-11-11 23:50:23,296 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1284 transitions. Word has length 231 [2024-11-11 23:50:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1284 transitions. [2024-11-11 23:50:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-11 23:50:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1284 transitions. [2024-11-11 23:50:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-11 23:50:23,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:23,299 INFO L218 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] [2024-11-11 23:50:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 23:50:23,300 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1541501838, now seen corresponding path program 1 times [2024-11-11 23:50:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111111865] [2024-11-11 23:50:23,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:23,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111111865] [2024-11-11 23:50:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111111865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620422103] [2024-11-11 23:50:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:23,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:23,844 INFO L87 Difference]: Start difference. First operand 873 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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-11-11 23:50:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:24,162 INFO L93 Difference]: Finished difference Result 1580 states and 2320 transitions. [2024-11-11 23:50:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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 232 [2024-11-11 23:50:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:24,167 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:24,167 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:24,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:24,169 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 1262 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:24,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 2253 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4711981566820276) internal successors, (1277), 868 states have internal predecessors, (1277), 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-11-11 23:50:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1283 transitions. [2024-11-11 23:50:24,196 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1283 transitions. Word has length 232 [2024-11-11 23:50:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1283 transitions. [2024-11-11 23:50:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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-11-11 23:50:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1283 transitions. [2024-11-11 23:50:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-11 23:50:24,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:24,203 INFO L218 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] [2024-11-11 23:50:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 23:50:24,204 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1057214980, now seen corresponding path program 1 times [2024-11-11 23:50:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756448225] [2024-11-11 23:50:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:24,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756448225] [2024-11-11 23:50:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756448225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:24,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:24,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942585748] [2024-11-11 23:50:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:24,832 INFO L87 Difference]: Start difference. First operand 873 states and 1283 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 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-11-11 23:50:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:25,175 INFO L93 Difference]: Finished difference Result 1580 states and 2318 transitions. [2024-11-11 23:50:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:25,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 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 233 [2024-11-11 23:50:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:25,181 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:25,181 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:25,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:25,184 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2347 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:25,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 2246 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4700460829493087) internal successors, (1276), 868 states have internal predecessors, (1276), 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-11-11 23:50:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1282 transitions. [2024-11-11 23:50:25,208 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1282 transitions. Word has length 233 [2024-11-11 23:50:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1282 transitions. [2024-11-11 23:50:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 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-11-11 23:50:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1282 transitions. [2024-11-11 23:50:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-11 23:50:25,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:25,212 INFO L218 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] [2024-11-11 23:50:25,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 23:50:25,212 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:25,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2031754123, now seen corresponding path program 1 times [2024-11-11 23:50:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61826099] [2024-11-11 23:50:25,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:25,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61826099] [2024-11-11 23:50:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61826099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:25,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033631996] [2024-11-11 23:50:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:25,905 INFO L87 Difference]: Start difference. First operand 873 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-11-11 23:50:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:26,190 INFO L93 Difference]: Finished difference Result 1580 states and 2316 transitions. [2024-11-11 23:50:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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 234 [2024-11-11 23:50:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:26,194 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:26,195 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:26,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:26,197 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2339 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:26,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 2246 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4688940092165899) internal successors, (1275), 868 states have internal predecessors, (1275), 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-11-11 23:50:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1281 transitions. [2024-11-11 23:50:26,215 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1281 transitions. Word has length 234 [2024-11-11 23:50:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:26,215 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1281 transitions. [2024-11-11 23:50:26,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 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-11-11 23:50:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1281 transitions. [2024-11-11 23:50:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-11 23:50:26,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:26,217 INFO L218 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] [2024-11-11 23:50:26,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 23:50:26,217 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:26,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1699528195, now seen corresponding path program 1 times [2024-11-11 23:50:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868954666] [2024-11-11 23:50:26,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:26,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868954666] [2024-11-11 23:50:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868954666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:26,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:26,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428606651] [2024-11-11 23:50:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:26,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:26,739 INFO L87 Difference]: Start difference. First operand 873 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-11-11 23:50:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:27,041 INFO L93 Difference]: Finished difference Result 1580 states and 2314 transitions. [2024-11-11 23:50:27,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:27,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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 235 [2024-11-11 23:50:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:27,045 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:27,046 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:27,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:27,047 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2331 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:27,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 2246 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.467741935483871) internal successors, (1274), 868 states have internal predecessors, (1274), 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-11-11 23:50:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1280 transitions. [2024-11-11 23:50:27,065 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1280 transitions. Word has length 235 [2024-11-11 23:50:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:27,065 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1280 transitions. [2024-11-11 23:50:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-11-11 23:50:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1280 transitions. [2024-11-11 23:50:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-11 23:50:27,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:27,067 INFO L218 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] [2024-11-11 23:50:27,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 23:50:27,068 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 341042396, now seen corresponding path program 1 times [2024-11-11 23:50:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094919986] [2024-11-11 23:50:27,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:27,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094919986] [2024-11-11 23:50:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094919986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62483123] [2024-11-11 23:50:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:27,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:27,605 INFO L87 Difference]: Start difference. First operand 873 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-11-11 23:50:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:27,910 INFO L93 Difference]: Finished difference Result 1580 states and 2312 transitions. [2024-11-11 23:50:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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 236 [2024-11-11 23:50:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:27,914 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:27,915 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:27,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:27,917 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2323 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:27,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2246 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4665898617511521) internal successors, (1273), 868 states have internal predecessors, (1273), 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-11-11 23:50:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1279 transitions. [2024-11-11 23:50:27,936 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1279 transitions. Word has length 236 [2024-11-11 23:50:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:27,937 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1279 transitions. [2024-11-11 23:50:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-11-11 23:50:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1279 transitions. [2024-11-11 23:50:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-11 23:50:27,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:27,943 INFO L218 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] [2024-11-11 23:50:27,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 23:50:27,943 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1386603914, now seen corresponding path program 1 times [2024-11-11 23:50:27,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:27,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065047123] [2024-11-11 23:50:27,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:27,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065047123] [2024-11-11 23:50:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065047123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814919663] [2024-11-11 23:50:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:28,477 INFO L87 Difference]: Start difference. First operand 873 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-11-11 23:50:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:28,757 INFO L93 Difference]: Finished difference Result 1580 states and 2310 transitions. [2024-11-11 23:50:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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 237 [2024-11-11 23:50:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:28,762 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:28,762 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:28,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:28,764 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 1242 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:28,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2253 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4654377880184333) internal successors, (1272), 868 states have internal predecessors, (1272), 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-11-11 23:50:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1278 transitions. [2024-11-11 23:50:28,781 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1278 transitions. Word has length 237 [2024-11-11 23:50:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1278 transitions. [2024-11-11 23:50:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-11-11 23:50:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1278 transitions. [2024-11-11 23:50:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-11 23:50:28,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:28,784 INFO L218 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] [2024-11-11 23:50:28,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 23:50:28,784 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:28,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 145634499, now seen corresponding path program 1 times [2024-11-11 23:50:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563523145] [2024-11-11 23:50:28,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:29,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:29,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563523145] [2024-11-11 23:50:29,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563523145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:29,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:29,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626569391] [2024-11-11 23:50:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:29,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:29,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:29,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:29,314 INFO L87 Difference]: Start difference. First operand 873 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-11-11 23:50:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:29,608 INFO L93 Difference]: Finished difference Result 1580 states and 2308 transitions. [2024-11-11 23:50:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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 238 [2024-11-11 23:50:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:29,612 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:29,613 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:29,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:29,614 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2307 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:29,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 2246 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4642857142857142) internal successors, (1271), 868 states have internal predecessors, (1271), 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-11-11 23:50:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1277 transitions. [2024-11-11 23:50:29,632 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1277 transitions. Word has length 238 [2024-11-11 23:50:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1277 transitions. [2024-11-11 23:50:29,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-11-11 23:50:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1277 transitions. [2024-11-11 23:50:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-11 23:50:29,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:29,634 INFO L218 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] [2024-11-11 23:50:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 23:50:29,635 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:29,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1282382703, now seen corresponding path program 1 times [2024-11-11 23:50:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484659790] [2024-11-11 23:50:29,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484659790] [2024-11-11 23:50:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484659790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30926058] [2024-11-11 23:50:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:30,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:30,219 INFO L87 Difference]: Start difference. First operand 873 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-11-11 23:50:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:30,514 INFO L93 Difference]: Finished difference Result 1580 states and 2306 transitions. [2024-11-11 23:50:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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 239 [2024-11-11 23:50:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:30,523 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:30,527 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:30,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:30,529 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2293 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:30,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 2246 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4631336405529953) internal successors, (1270), 868 states have internal predecessors, (1270), 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-11-11 23:50:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1276 transitions. [2024-11-11 23:50:30,546 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1276 transitions. Word has length 239 [2024-11-11 23:50:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:30,547 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1276 transitions. [2024-11-11 23:50:30,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-11-11 23:50:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1276 transitions. [2024-11-11 23:50:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 23:50:30,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:30,549 INFO L218 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] [2024-11-11 23:50:30,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 23:50:30,550 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:30,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 928212963, now seen corresponding path program 1 times [2024-11-11 23:50:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:30,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166709403] [2024-11-11 23:50:30,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:31,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166709403] [2024-11-11 23:50:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166709403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:31,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376946533] [2024-11-11 23:50:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:31,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:31,096 INFO L87 Difference]: Start difference. First operand 873 states and 1276 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11-11 23:50:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:31,341 INFO L93 Difference]: Finished difference Result 1580 states and 2304 transitions. [2024-11-11 23:50:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:31,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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 240 [2024-11-11 23:50:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:31,345 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:31,345 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:31,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:31,347 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2285 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:31,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2246 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4619815668202765) internal successors, (1269), 868 states have internal predecessors, (1269), 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-11-11 23:50:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1275 transitions. [2024-11-11 23:50:31,367 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1275 transitions. Word has length 240 [2024-11-11 23:50:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:31,367 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1275 transitions. [2024-11-11 23:50:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11-11 23:50:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1275 transitions. [2024-11-11 23:50:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-11 23:50:31,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:31,369 INFO L218 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] [2024-11-11 23:50:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 23:50:31,371 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -45073206, now seen corresponding path program 1 times [2024-11-11 23:50:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073092970] [2024-11-11 23:50:31,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073092970] [2024-11-11 23:50:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073092970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420988890] [2024-11-11 23:50:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:31,910 INFO L87 Difference]: Start difference. First operand 873 states and 1275 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-11-11 23:50:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:32,170 INFO L93 Difference]: Finished difference Result 1580 states and 2302 transitions. [2024-11-11 23:50:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:32,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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 241 [2024-11-11 23:50:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:32,173 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:32,174 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:32,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:32,176 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2277 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:32,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 2246 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4608294930875576) internal successors, (1268), 868 states have internal predecessors, (1268), 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-11-11 23:50:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1274 transitions. [2024-11-11 23:50:32,194 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1274 transitions. Word has length 241 [2024-11-11 23:50:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:32,195 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1274 transitions. [2024-11-11 23:50:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-11-11 23:50:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1274 transitions. [2024-11-11 23:50:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-11 23:50:32,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:32,197 INFO L218 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] [2024-11-11 23:50:32,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 23:50:32,197 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1058184444, now seen corresponding path program 1 times [2024-11-11 23:50:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924030708] [2024-11-11 23:50:32,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:32,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924030708] [2024-11-11 23:50:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924030708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:32,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537059006] [2024-11-11 23:50:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:32,737 INFO L87 Difference]: Start difference. First operand 873 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11-11 23:50:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:32,965 INFO L93 Difference]: Finished difference Result 1580 states and 2300 transitions. [2024-11-11 23:50:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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 242 [2024-11-11 23:50:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:32,969 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:32,969 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:32,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:32,971 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 1219 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:32,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2253 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4596774193548387) internal successors, (1267), 868 states have internal predecessors, (1267), 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-11-11 23:50:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1273 transitions. [2024-11-11 23:50:32,990 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1273 transitions. Word has length 242 [2024-11-11 23:50:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:32,990 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1273 transitions. [2024-11-11 23:50:32,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11-11 23:50:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1273 transitions. [2024-11-11 23:50:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-11 23:50:32,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:32,992 INFO L218 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] [2024-11-11 23:50:32,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 23:50:32,993 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1816892803, now seen corresponding path program 1 times [2024-11-11 23:50:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:32,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711057019] [2024-11-11 23:50:32,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711057019] [2024-11-11 23:50:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711057019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209393081] [2024-11-11 23:50:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:33,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:33,505 INFO L87 Difference]: Start difference. First operand 873 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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-11-11 23:50:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:33,741 INFO L93 Difference]: Finished difference Result 1580 states and 2298 transitions. [2024-11-11 23:50:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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 243 [2024-11-11 23:50:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:33,744 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:33,744 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:33,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:33,746 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 2261 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:33,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 2246 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4585253456221199) internal successors, (1266), 868 states have internal predecessors, (1266), 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-11-11 23:50:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1272 transitions. [2024-11-11 23:50:33,765 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1272 transitions. Word has length 243 [2024-11-11 23:50:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:33,765 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1272 transitions. [2024-11-11 23:50:33,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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-11-11 23:50:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1272 transitions. [2024-11-11 23:50:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-11 23:50:33,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:33,767 INFO L218 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] [2024-11-11 23:50:33,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 23:50:33,768 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:33,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -682276203, now seen corresponding path program 1 times [2024-11-11 23:50:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498651592] [2024-11-11 23:50:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498651592] [2024-11-11 23:50:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498651592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125216809] [2024-11-11 23:50:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:34,461 INFO L87 Difference]: Start difference. First operand 873 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-11-11 23:50:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:34,529 INFO L93 Difference]: Finished difference Result 1580 states and 2296 transitions. [2024-11-11 23:50:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 244 [2024-11-11 23:50:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:34,532 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:34,532 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:34,533 INFO L434 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-11-11 23:50:34,534 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 1131 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:34,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2494 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.456221198156682) internal successors, (1264), 868 states have internal predecessors, (1264), 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-11-11 23:50:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1270 transitions. [2024-11-11 23:50:34,552 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1270 transitions. Word has length 244 [2024-11-11 23:50:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:34,552 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1270 transitions. [2024-11-11 23:50:34,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-11-11 23:50:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1270 transitions. [2024-11-11 23:50:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-11 23:50:34,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:34,554 INFO L218 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] [2024-11-11 23:50:34,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 23:50:34,555 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2016030126, now seen corresponding path program 1 times [2024-11-11 23:50:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303096844] [2024-11-11 23:50:34,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303096844] [2024-11-11 23:50:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303096844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309835730] [2024-11-11 23:50:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:35,156 INFO L87 Difference]: Start difference. First operand 873 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-11-11 23:50:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:35,226 INFO L93 Difference]: Finished difference Result 1580 states and 2292 transitions. [2024-11-11 23:50:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:35,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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 246 [2024-11-11 23:50:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:35,229 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:35,229 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:35,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:35,231 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 2377 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:35,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 2494 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.455069124423963) internal successors, (1263), 868 states have internal predecessors, (1263), 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-11-11 23:50:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1269 transitions. [2024-11-11 23:50:35,249 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1269 transitions. Word has length 246 [2024-11-11 23:50:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:35,249 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1269 transitions. [2024-11-11 23:50:35,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-11-11 23:50:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1269 transitions. [2024-11-11 23:50:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-11 23:50:35,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:35,251 INFO L218 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] [2024-11-11 23:50:35,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 23:50:35,252 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 693455590, now seen corresponding path program 1 times [2024-11-11 23:50:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277035594] [2024-11-11 23:50:35,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:35,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 23:50:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 23:50:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277035594] [2024-11-11 23:50:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277035594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:35,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494442116] [2024-11-11 23:50:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:35,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:35,926 INFO L87 Difference]: Start difference. First operand 873 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:36,042 INFO L93 Difference]: Finished difference Result 1580 states and 2290 transitions. [2024-11-11 23:50:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:36,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 247 [2024-11-11 23:50:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:36,045 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:36,045 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:36,046 INFO L434 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-11-11 23:50:36,046 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 1166 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:36,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 2500 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4539170506912442) internal successors, (1262), 868 states have internal predecessors, (1262), 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-11-11 23:50:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1268 transitions. [2024-11-11 23:50:36,074 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1268 transitions. Word has length 247 [2024-11-11 23:50:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:36,075 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1268 transitions. [2024-11-11 23:50:36,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1268 transitions. [2024-11-11 23:50:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-11 23:50:36,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:36,078 INFO L218 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] [2024-11-11 23:50:36,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 23:50:36,078 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:36,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 150370404, now seen corresponding path program 1 times [2024-11-11 23:50:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552571196] [2024-11-11 23:50:36,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 23:50:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 23:50:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552571196] [2024-11-11 23:50:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552571196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:36,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975457779] [2024-11-11 23:50:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:36,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:36,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:36,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:36,945 INFO L87 Difference]: Start difference. First operand 873 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:37,012 INFO L93 Difference]: Finished difference Result 1580 states and 2288 transitions. [2024-11-11 23:50:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 248 [2024-11-11 23:50:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:37,015 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:37,015 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:37,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-11 23:50:37,018 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 1164 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 2500 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4527649769585254) internal successors, (1261), 868 states have internal predecessors, (1261), 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-11-11 23:50:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1267 transitions. [2024-11-11 23:50:37,042 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1267 transitions. Word has length 248 [2024-11-11 23:50:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1267 transitions. [2024-11-11 23:50:37,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1267 transitions. [2024-11-11 23:50:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-11 23:50:37,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:37,045 INFO L218 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] [2024-11-11 23:50:37,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 23:50:37,046 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1257331331, now seen corresponding path program 1 times [2024-11-11 23:50:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865438942] [2024-11-11 23:50:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865438942] [2024-11-11 23:50:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865438942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:37,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124068521] [2024-11-11 23:50:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:37,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:37,883 INFO L87 Difference]: Start difference. First operand 873 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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-11-11 23:50:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:38,011 INFO L93 Difference]: Finished difference Result 1580 states and 2286 transitions. [2024-11-11 23:50:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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 249 [2024-11-11 23:50:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:38,014 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:38,014 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:38,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:38,016 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 1118 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:38,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3672 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4516129032258065) internal successors, (1260), 868 states have internal predecessors, (1260), 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-11-11 23:50:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1266 transitions. [2024-11-11 23:50:38,042 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1266 transitions. Word has length 249 [2024-11-11 23:50:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:38,043 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1266 transitions. [2024-11-11 23:50:38,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 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-11-11 23:50:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1266 transitions. [2024-11-11 23:50:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-11 23:50:38,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:38,045 INFO L218 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] [2024-11-11 23:50:38,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 23:50:38,046 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash 974291473, now seen corresponding path program 1 times [2024-11-11 23:50:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821414576] [2024-11-11 23:50:38,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821414576] [2024-11-11 23:50:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821414576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:38,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390315403] [2024-11-11 23:50:38,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:38,920 INFO L87 Difference]: Start difference. First operand 873 states and 1266 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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-11-11 23:50:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:39,043 INFO L93 Difference]: Finished difference Result 1580 states and 2284 transitions. [2024-11-11 23:50:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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 250 [2024-11-11 23:50:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:39,046 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:39,046 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:39,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:39,047 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 2226 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2226 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:39,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2226 Valid, 2452 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4504608294930876) internal successors, (1259), 868 states have internal predecessors, (1259), 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-11-11 23:50:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1265 transitions. [2024-11-11 23:50:39,064 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1265 transitions. Word has length 250 [2024-11-11 23:50:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:39,064 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1265 transitions. [2024-11-11 23:50:39,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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-11-11 23:50:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1265 transitions. [2024-11-11 23:50:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-11 23:50:39,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:39,066 INFO L218 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] [2024-11-11 23:50:39,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 23:50:39,067 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:39,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1194113988, now seen corresponding path program 1 times [2024-11-11 23:50:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947265505] [2024-11-11 23:50:39,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:39,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947265505] [2024-11-11 23:50:39,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947265505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:39,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:39,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:39,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109745210] [2024-11-11 23:50:39,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:39,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:39,936 INFO L87 Difference]: Start difference. First operand 873 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:40,060 INFO L93 Difference]: Finished difference Result 1580 states and 2282 transitions. [2024-11-11 23:50:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 251 [2024-11-11 23:50:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:40,062 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:40,062 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:40,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:40,064 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 1114 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:40,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2459 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4493087557603688) internal successors, (1258), 868 states have internal predecessors, (1258), 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-11-11 23:50:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1264 transitions. [2024-11-11 23:50:40,080 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1264 transitions. Word has length 251 [2024-11-11 23:50:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:40,080 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1264 transitions. [2024-11-11 23:50:40,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1264 transitions. [2024-11-11 23:50:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-11 23:50:40,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:40,082 INFO L218 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] [2024-11-11 23:50:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 23:50:40,083 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1041211248, now seen corresponding path program 1 times [2024-11-11 23:50:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812902655] [2024-11-11 23:50:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812902655] [2024-11-11 23:50:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812902655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427164093] [2024-11-11 23:50:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:40,844 INFO L87 Difference]: Start difference. First operand 873 states and 1264 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-11-11 23:50:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:41,024 INFO L93 Difference]: Finished difference Result 1580 states and 2280 transitions. [2024-11-11 23:50:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:41,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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 252 [2024-11-11 23:50:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:41,027 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:41,028 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:41,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:41,029 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 1101 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:41,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2374 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4481566820276497) internal successors, (1257), 868 states have internal predecessors, (1257), 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-11-11 23:50:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1263 transitions. [2024-11-11 23:50:41,046 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1263 transitions. Word has length 252 [2024-11-11 23:50:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:41,047 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1263 transitions. [2024-11-11 23:50:41,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-11-11 23:50:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1263 transitions. [2024-11-11 23:50:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-11 23:50:41,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:41,049 INFO L218 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] [2024-11-11 23:50:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 23:50:41,049 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1956600604, now seen corresponding path program 1 times [2024-11-11 23:50:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:41,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407279825] [2024-11-11 23:50:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407279825] [2024-11-11 23:50:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407279825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:41,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:41,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:41,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862586138] [2024-11-11 23:50:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:41,797 INFO L87 Difference]: Start difference. First operand 873 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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-11-11 23:50:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:41,987 INFO L93 Difference]: Finished difference Result 1580 states and 2278 transitions. [2024-11-11 23:50:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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 253 [2024-11-11 23:50:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:41,990 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:41,990 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:41,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:41,992 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 2190 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:41,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2374 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4470046082949308) internal successors, (1256), 868 states have internal predecessors, (1256), 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-11-11 23:50:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1262 transitions. [2024-11-11 23:50:42,010 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1262 transitions. Word has length 253 [2024-11-11 23:50:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:42,011 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1262 transitions. [2024-11-11 23:50:42,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 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-11-11 23:50:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1262 transitions. [2024-11-11 23:50:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-11 23:50:42,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:42,013 INFO L218 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] [2024-11-11 23:50:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-11 23:50:42,013 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1801333743, now seen corresponding path program 1 times [2024-11-11 23:50:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017472042] [2024-11-11 23:50:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017472042] [2024-11-11 23:50:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017472042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282549419] [2024-11-11 23:50:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:42,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:42,690 INFO L87 Difference]: Start difference. First operand 873 states and 1262 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-11-11 23:50:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:42,865 INFO L93 Difference]: Finished difference Result 1580 states and 2276 transitions. [2024-11-11 23:50:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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 254 [2024-11-11 23:50:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:42,868 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:42,869 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:42,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:42,870 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 1096 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:42,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 2381 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.445852534562212) internal successors, (1255), 868 states have internal predecessors, (1255), 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-11-11 23:50:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1261 transitions. [2024-11-11 23:50:42,891 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1261 transitions. Word has length 254 [2024-11-11 23:50:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:42,892 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1261 transitions. [2024-11-11 23:50:42,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-11-11 23:50:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1261 transitions. [2024-11-11 23:50:42,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-11 23:50:42,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:42,895 INFO L218 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] [2024-11-11 23:50:42,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-11 23:50:42,896 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1371089187, now seen corresponding path program 1 times [2024-11-11 23:50:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:42,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742866195] [2024-11-11 23:50:42,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:42,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:43,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-11-11 23:50:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742866195] [2024-11-11 23:50:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742866195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:43,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868307177] [2024-11-11 23:50:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:43,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:43,687 INFO L87 Difference]: Start difference. First operand 873 states and 1261 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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-11-11 23:50:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:43,876 INFO L93 Difference]: Finished difference Result 1580 states and 2274 transitions. [2024-11-11 23:50:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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 255 [2024-11-11 23:50:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:43,879 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:43,879 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:43,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:43,881 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 1095 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 2381 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.444700460829493) internal successors, (1254), 868 states have internal predecessors, (1254), 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-11-11 23:50:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1260 transitions. [2024-11-11 23:50:43,896 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1260 transitions. Word has length 255 [2024-11-11 23:50:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:43,897 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1260 transitions. [2024-11-11 23:50:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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-11-11 23:50:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1260 transitions. [2024-11-11 23:50:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-11 23:50:43,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:43,899 INFO L218 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] [2024-11-11 23:50:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-11 23:50:43,899 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1554746350, now seen corresponding path program 1 times [2024-11-11 23:50:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86334859] [2024-11-11 23:50:43,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:44,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:44,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:44,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86334859] [2024-11-11 23:50:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86334859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839584046] [2024-11-11 23:50:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:44,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:44,624 INFO L87 Difference]: Start difference. First operand 873 states and 1260 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-11-11 23:50:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:44,773 INFO L93 Difference]: Finished difference Result 1580 states and 2272 transitions. [2024-11-11 23:50:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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 256 [2024-11-11 23:50:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:44,776 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:44,776 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:44,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-11 23:50:44,777 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 1079 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 2374 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4435483870967742) internal successors, (1253), 868 states have internal predecessors, (1253), 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-11-11 23:50:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1259 transitions. [2024-11-11 23:50:44,794 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1259 transitions. Word has length 256 [2024-11-11 23:50:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1259 transitions. [2024-11-11 23:50:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-11-11 23:50:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1259 transitions. [2024-11-11 23:50:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-11 23:50:44,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:44,796 INFO L218 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] [2024-11-11 23:50:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-11 23:50:44,796 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1792821474, now seen corresponding path program 1 times [2024-11-11 23:50:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071221916] [2024-11-11 23:50:44,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:45,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071221916] [2024-11-11 23:50:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071221916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:45,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:45,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:45,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312406543] [2024-11-11 23:50:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:45,469 INFO L87 Difference]: Start difference. First operand 873 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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-11-11 23:50:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:45,633 INFO L93 Difference]: Finished difference Result 1580 states and 2270 transitions. [2024-11-11 23:50:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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 257 [2024-11-11 23:50:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:45,635 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:45,635 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:45,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:45,637 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 2166 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:45,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2374 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4423963133640554) internal successors, (1252), 868 states have internal predecessors, (1252), 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-11-11 23:50:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1258 transitions. [2024-11-11 23:50:45,651 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1258 transitions. Word has length 257 [2024-11-11 23:50:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:45,651 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1258 transitions. [2024-11-11 23:50:45,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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-11-11 23:50:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1258 transitions. [2024-11-11 23:50:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-11 23:50:45,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:45,654 INFO L218 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] [2024-11-11 23:50:45,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-11 23:50:45,654 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:45,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash -28004205, now seen corresponding path program 1 times [2024-11-11 23:50:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:45,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815240102] [2024-11-11 23:50:45,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815240102] [2024-11-11 23:50:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815240102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672126662] [2024-11-11 23:50:46,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:46,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:46,379 INFO L87 Difference]: Start difference. First operand 873 states and 1258 transitions. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-11-11 23:50:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:46,554 INFO L93 Difference]: Finished difference Result 1580 states and 2268 transitions. [2024-11-11 23:50:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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 258 [2024-11-11 23:50:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:46,558 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:46,558 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:46,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:46,561 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 2160 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:46,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2374 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4412442396313363) internal successors, (1251), 868 states have internal predecessors, (1251), 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-11-11 23:50:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1257 transitions. [2024-11-11 23:50:46,577 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1257 transitions. Word has length 258 [2024-11-11 23:50:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:46,578 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1257 transitions. [2024-11-11 23:50:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-11-11 23:50:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1257 transitions. [2024-11-11 23:50:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-11 23:50:46,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:46,580 INFO L218 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] [2024-11-11 23:50:46,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-11 23:50:46,580 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1997902881, now seen corresponding path program 1 times [2024-11-11 23:50:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:46,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239101600] [2024-11-11 23:50:46,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239101600] [2024-11-11 23:50:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239101600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:47,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147850722] [2024-11-11 23:50:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:47,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:47,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:47,244 INFO L87 Difference]: Start difference. First operand 873 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-11-11 23:50:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:47,503 INFO L93 Difference]: Finished difference Result 1580 states and 2266 transitions. [2024-11-11 23:50:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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 259 [2024-11-11 23:50:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:47,505 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:47,505 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:47,507 INFO L434 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-11-11 23:50:47,507 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1061 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:47,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 2216 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4400921658986174) internal successors, (1250), 868 states have internal predecessors, (1250), 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-11-11 23:50:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1256 transitions. [2024-11-11 23:50:47,524 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1256 transitions. Word has length 259 [2024-11-11 23:50:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:47,525 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1256 transitions. [2024-11-11 23:50:47,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-11-11 23:50:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1256 transitions. [2024-11-11 23:50:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-11 23:50:47,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:47,527 INFO L218 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] [2024-11-11 23:50:47,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-11 23:50:47,527 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:47,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 165499379, now seen corresponding path program 1 times [2024-11-11 23:50:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559659981] [2024-11-11 23:50:47,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559659981] [2024-11-11 23:50:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559659981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801873721] [2024-11-11 23:50:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:48,384 INFO L87 Difference]: Start difference. First operand 873 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-11-11 23:50:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:48,681 INFO L93 Difference]: Finished difference Result 1580 states and 2264 transitions. [2024-11-11 23:50:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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 260 [2024-11-11 23:50:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:48,684 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:48,684 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:48,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:48,686 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 2114 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:48,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 2216 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4389400921658986) internal successors, (1249), 868 states have internal predecessors, (1249), 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-11-11 23:50:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1255 transitions. [2024-11-11 23:50:48,706 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1255 transitions. Word has length 260 [2024-11-11 23:50:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1255 transitions. [2024-11-11 23:50:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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-11-11 23:50:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1255 transitions. [2024-11-11 23:50:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-11 23:50:48,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:48,709 INFO L218 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] [2024-11-11 23:50:48,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-11 23:50:48,710 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1704585826, now seen corresponding path program 1 times [2024-11-11 23:50:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:48,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374213677] [2024-11-11 23:50:48,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374213677] [2024-11-11 23:50:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374213677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075125251] [2024-11-11 23:50:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:49,443 INFO L87 Difference]: Start difference. First operand 873 states and 1255 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-11-11 23:50:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:49,734 INFO L93 Difference]: Finished difference Result 1580 states and 2262 transitions. [2024-11-11 23:50:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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 261 [2024-11-11 23:50:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:49,737 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:49,737 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:49,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:49,739 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1058 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:49,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 2223 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4377880184331797) internal successors, (1248), 868 states have internal predecessors, (1248), 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-11-11 23:50:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1254 transitions. [2024-11-11 23:50:49,756 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1254 transitions. Word has length 261 [2024-11-11 23:50:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1254 transitions. [2024-11-11 23:50:49,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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-11-11 23:50:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1254 transitions. [2024-11-11 23:50:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-11 23:50:49,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:49,758 INFO L218 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] [2024-11-11 23:50:49,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-11 23:50:49,758 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:49,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 831794034, now seen corresponding path program 1 times [2024-11-11 23:50:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:49,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748072328] [2024-11-11 23:50:49,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748072328] [2024-11-11 23:50:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748072328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252417642] [2024-11-11 23:50:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:50,491 INFO L87 Difference]: Start difference. First operand 873 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-11 23:50:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:50,804 INFO L93 Difference]: Finished difference Result 1580 states and 2260 transitions. [2024-11-11 23:50:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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 262 [2024-11-11 23:50:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:50,807 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:50,807 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:50,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:50,808 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1057 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:50,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 2223 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4366359447004609) internal successors, (1247), 868 states have internal predecessors, (1247), 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-11-11 23:50:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1253 transitions. [2024-11-11 23:50:50,824 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1253 transitions. Word has length 262 [2024-11-11 23:50:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:50,825 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1253 transitions. [2024-11-11 23:50:50,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-11 23:50:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1253 transitions. [2024-11-11 23:50:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-11 23:50:50,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:50,827 INFO L218 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] [2024-11-11 23:50:50,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-11 23:50:50,827 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:50,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -686818013, now seen corresponding path program 1 times [2024-11-11 23:50:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879415955] [2024-11-11 23:50:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,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-11-11 23:50:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879415955] [2024-11-11 23:50:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879415955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115387832] [2024-11-11 23:50:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:51,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:51,796 INFO L87 Difference]: Start difference. First operand 873 states and 1253 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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-11-11 23:50:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:52,107 INFO L93 Difference]: Finished difference Result 1580 states and 2258 transitions. [2024-11-11 23:50:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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 263 [2024-11-11 23:50:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:52,112 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:52,113 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:52,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:52,114 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 2096 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:52,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 2216 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.435483870967742) internal successors, (1246), 868 states have internal predecessors, (1246), 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-11-11 23:50:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1252 transitions. [2024-11-11 23:50:52,131 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1252 transitions. Word has length 263 [2024-11-11 23:50:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:52,131 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1252 transitions. [2024-11-11 23:50:52,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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-11-11 23:50:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1252 transitions. [2024-11-11 23:50:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-11 23:50:52,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:52,134 INFO L218 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] [2024-11-11 23:50:52,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-11 23:50:52,134 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1134620559, now seen corresponding path program 1 times [2024-11-11 23:50:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137476922] [2024-11-11 23:50:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137476922] [2024-11-11 23:50:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137476922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289376132] [2024-11-11 23:50:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:52,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:52,832 INFO L87 Difference]: Start difference. First operand 873 states and 1252 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-11-11 23:50:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:53,131 INFO L93 Difference]: Finished difference Result 1580 states and 2256 transitions. [2024-11-11 23:50:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:53,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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 264 [2024-11-11 23:50:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:53,133 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:53,133 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:53,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:53,136 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1055 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:53,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 2223 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4343317972350231) internal successors, (1245), 868 states have internal predecessors, (1245), 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-11-11 23:50:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1251 transitions. [2024-11-11 23:50:53,156 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1251 transitions. Word has length 264 [2024-11-11 23:50:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:53,156 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1251 transitions. [2024-11-11 23:50:53,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-11-11 23:50:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1251 transitions. [2024-11-11 23:50:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-11 23:50:53,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:53,158 INFO L218 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] [2024-11-11 23:50:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-11 23:50:53,159 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -443532188, now seen corresponding path program 1 times [2024-11-11 23:50:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584872956] [2024-11-11 23:50:53,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584872956] [2024-11-11 23:50:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584872956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881852906] [2024-11-11 23:50:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:53,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:53,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:53,842 INFO L87 Difference]: Start difference. First operand 873 states and 1251 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 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-11-11 23:50:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:54,123 INFO L93 Difference]: Finished difference Result 1580 states and 2254 transitions. [2024-11-11 23:50:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 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 265 [2024-11-11 23:50:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:54,125 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:54,125 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:54,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:54,126 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1054 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:54,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2223 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.433179723502304) internal successors, (1244), 868 states have internal predecessors, (1244), 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-11-11 23:50:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1250 transitions. [2024-11-11 23:50:54,141 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1250 transitions. Word has length 265 [2024-11-11 23:50:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:54,142 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1250 transitions. [2024-11-11 23:50:54,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 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-11-11 23:50:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1250 transitions. [2024-11-11 23:50:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-11 23:50:54,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:54,144 INFO L218 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] [2024-11-11 23:50:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-11 23:50:54,144 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2017300720, now seen corresponding path program 1 times [2024-11-11 23:50:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355817199] [2024-11-11 23:50:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:54,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355817199] [2024-11-11 23:50:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355817199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:54,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148900474] [2024-11-11 23:50:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:54,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:54,808 INFO L87 Difference]: Start difference. First operand 873 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-11-11 23:50:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:55,112 INFO L93 Difference]: Finished difference Result 1580 states and 2252 transitions. [2024-11-11 23:50:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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 266 [2024-11-11 23:50:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:55,114 INFO L225 Difference]: With dead ends: 1580 [2024-11-11 23:50:55,114 INFO L226 Difference]: Without dead ends: 873 [2024-11-11 23:50:55,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-11 23:50:55,116 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 1053 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:55,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 2223 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-11 23:50:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-11-11 23:50:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 868 states have (on average 1.4320276497695852) internal successors, (1243), 868 states have internal predecessors, (1243), 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-11-11 23:50:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1249 transitions. [2024-11-11 23:50:55,133 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1249 transitions. Word has length 266 [2024-11-11 23:50:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:55,134 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1249 transitions. [2024-11-11 23:50:55,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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-11-11 23:50:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1249 transitions. [2024-11-11 23:50:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-11 23:50:55,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:55,136 INFO L218 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] [2024-11-11 23:50:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-11 23:50:55,136 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 172169253, now seen corresponding path program 1 times [2024-11-11 23:50:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458950882] [2024-11-11 23:50:55,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 23:50:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 23:50:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 23:50:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458950882] [2024-11-11 23:50:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458950882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673681439] [2024-11-11 23:50:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:55,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:55,778 INFO L87 Difference]: Start difference. First operand 873 states and 1249 transitions. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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)