./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:56:05,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:56:05,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:56:05,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:56:05,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:56:05,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:56:05,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:56:05,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:56:05,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:56:05,229 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:56:05,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:56:05,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:56:05,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:56:05,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:56:05,231 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:05,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:56:05,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:56:05,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:56:05,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:56:05,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:56:05,232 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df [2025-03-08 05:56:05,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:56:05,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:56:05,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:56:05,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:56:05,480 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:56:05,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:06,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462eb1272/2813588015184b5cbde214238e81e748/FLAGb4091da6e [2025-03-08 05:56:06,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:56:06,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:06,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462eb1272/2813588015184b5cbde214238e81e748/FLAGb4091da6e [2025-03-08 05:56:07,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462eb1272/2813588015184b5cbde214238e81e748 [2025-03-08 05:56:07,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:56:07,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:56:07,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:07,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:56:07,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:56:07,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a0cc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07, skipping insertion in model container [2025-03-08 05:56:07,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:56:07,443 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2025-03-08 05:56:07,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:07,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:56:07,522 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c[14577,14590] [2025-03-08 05:56:07,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:07,535 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:56:07,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07 WrapperNode [2025-03-08 05:56:07,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:07,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:07,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:56:07,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:56:07,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,570 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 505 [2025-03-08 05:56:07,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:07,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:56:07,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:56:07,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:56:07,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,600 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]. [2025-03-08 05:56:07,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:56:07,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:56:07,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:56:07,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:56:07,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:07,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:07,651 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) [2025-03-08 05:56:07,654 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 [2025-03-08 05:56:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2025-03-08 05:56:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2025-03-08 05:56:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:56:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2025-03-08 05:56:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2025-03-08 05:56:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-08 05:56:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-08 05:56:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:56:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:56:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:56:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2025-03-08 05:56:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2025-03-08 05:56:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:56:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:56:07,673 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2025-03-08 05:56:07,673 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2025-03-08 05:56:07,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:56:07,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:56:08,254 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 05:56:08,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:56:08,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:56:08,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:56:08,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:08 BoogieIcfgContainer [2025-03-08 05:56:08,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:56:08,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:56:08,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:56:08,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:56:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:56:07" (1/3) ... [2025-03-08 05:56:08,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546937d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:08, skipping insertion in model container [2025-03-08 05:56:08,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (2/3) ... [2025-03-08 05:56:08,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546937d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:08, skipping insertion in model container [2025-03-08 05:56:08,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:08" (3/3) ... [2025-03-08 05:56:08,281 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:08,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:56:08,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c that has 7 procedures, 172 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:56:08,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:56:08,374 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;@4c2a3143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:56:08,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:56:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 137 states have internal predecessors, (211), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:56:08,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:08,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:08,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -203772679, now seen corresponding path program 1 times [2025-03-08 05:56:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672302218] [2025-03-08 05:56:08,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:08,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:56:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:56:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:08,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672302218] [2025-03-08 05:56:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672302218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:56:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976677290] [2025-03-08 05:56:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:56:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:08,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:56:08,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:56:08,656 INFO L87 Difference]: Start difference. First operand has 172 states, 135 states have (on average 1.5629629629629629) internal successors, (211), 137 states have internal predecessors, (211), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:08,699 INFO L93 Difference]: Finished difference Result 325 states and 536 transitions. [2025-03-08 05:56:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:56:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-08 05:56:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:08,710 INFO L225 Difference]: With dead ends: 325 [2025-03-08 05:56:08,710 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 05:56:08,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:56:08,719 INFO L435 NwaCegarLoop]: 264 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, 264 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 [2025-03-08 05:56:08,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 05:56:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 05:56:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 134 states have internal predecessors, (206), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2025-03-08 05:56:08,771 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 28 [2025-03-08 05:56:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2025-03-08 05:56:08,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2025-03-08 05:56:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:56:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:08,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:56:08,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2053138328, now seen corresponding path program 1 times [2025-03-08 05:56:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880416967] [2025-03-08 05:56:08,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:56:08,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:56:08,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:08,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880416967] [2025-03-08 05:56:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880416967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995067682] [2025-03-08 05:56:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:09,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:09,072 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,183 INFO L93 Difference]: Finished difference Result 324 states and 502 transitions. [2025-03-08 05:56:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:56:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-08 05:56:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,185 INFO L225 Difference]: With dead ends: 324 [2025-03-08 05:56:09,185 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 05:56:09,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:09,186 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 05:56:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 05:56:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.4586466165413534) internal successors, (194), 134 states have internal predecessors, (194), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2025-03-08 05:56:09,210 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 28 [2025-03-08 05:56:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,210 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2025-03-08 05:56:09,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2025-03-08 05:56:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:56:09,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:56:09,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 615521875, now seen corresponding path program 1 times [2025-03-08 05:56:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357006325] [2025-03-08 05:56:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:56:09,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:56:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:09,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357006325] [2025-03-08 05:56:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357006325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745952619] [2025-03-08 05:56:09,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:09,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:09,497 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,556 INFO L93 Difference]: Finished difference Result 325 states and 494 transitions. [2025-03-08 05:56:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-03-08 05:56:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,558 INFO L225 Difference]: With dead ends: 325 [2025-03-08 05:56:09,559 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 05:56:09,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:09,561 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 728 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 05:56:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-08 05:56:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 137 states have internal predecessors, (197), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2025-03-08 05:56:09,571 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 39 [2025-03-08 05:56:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,571 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2025-03-08 05:56:09,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2025-03-08 05:56:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:56:09,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:56:09,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1651365689, now seen corresponding path program 1 times [2025-03-08 05:56:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657156953] [2025-03-08 05:56:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:56:09,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:56:09,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657156953] [2025-03-08 05:56:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657156953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462113572] [2025-03-08 05:56:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:09,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,672 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,719 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2025-03-08 05:56:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2025-03-08 05:56:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,721 INFO L225 Difference]: With dead ends: 476 [2025-03-08 05:56:09,721 INFO L226 Difference]: Without dead ends: 320 [2025-03-08 05:56:09,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,722 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 208 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 500 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-08 05:56:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 315. [2025-03-08 05:56:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 243 states have (on average 1.4691358024691359) internal successors, (357), 245 states have internal predecessors, (357), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 05:56:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2025-03-08 05:56:09,758 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 55 [2025-03-08 05:56:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,758 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2025-03-08 05:56:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2025-03-08 05:56:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:09,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:56:09,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1398481475, now seen corresponding path program 1 times [2025-03-08 05:56:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348160898] [2025-03-08 05:56:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:56:09,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:56:09,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348160898] [2025-03-08 05:56:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348160898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372480322] [2025-03-08 05:56:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,849 INFO L87 Difference]: Start difference. First operand 315 states and 471 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,899 INFO L93 Difference]: Finished difference Result 887 states and 1337 transitions. [2025-03-08 05:56:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-03-08 05:56:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,906 INFO L225 Difference]: With dead ends: 887 [2025-03-08 05:56:09,906 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 05:56:09,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,908 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 204 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 517 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 05:56:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 574. [2025-03-08 05:56:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 432 states have (on average 1.474537037037037) internal successors, (637), 436 states have internal predecessors, (637), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 05:56:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 863 transitions. [2025-03-08 05:56:09,953 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 863 transitions. Word has length 56 [2025-03-08 05:56:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,953 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 863 transitions. [2025-03-08 05:56:09,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 863 transitions. [2025-03-08 05:56:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:09,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,957 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:09,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:56:09,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 109070334, now seen corresponding path program 1 times [2025-03-08 05:56:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962953495] [2025-03-08 05:56:09,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:56:10,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:56:10,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962953495] [2025-03-08 05:56:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962953495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834559456] [2025-03-08 05:56:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:10,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,120 INFO L87 Difference]: Start difference. First operand 574 states and 863 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,276 INFO L93 Difference]: Finished difference Result 1224 states and 1839 transitions. [2025-03-08 05:56:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-03-08 05:56:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,283 INFO L225 Difference]: With dead ends: 1224 [2025-03-08 05:56:10,283 INFO L226 Difference]: Without dead ends: 667 [2025-03-08 05:56:10,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:10,287 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-08 05:56:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2025-03-08 05:56:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 501 states have (on average 1.4610778443113772) internal successors, (732), 504 states have internal predecessors, (732), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 966 transitions. [2025-03-08 05:56:10,353 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 966 transitions. Word has length 56 [2025-03-08 05:56:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,353 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 966 transitions. [2025-03-08 05:56:10,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 966 transitions. [2025-03-08 05:56:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:56:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:56:10,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -742135692, now seen corresponding path program 1 times [2025-03-08 05:56:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74930346] [2025-03-08 05:56:10,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:56:10,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:56:10,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74930346] [2025-03-08 05:56:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74930346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877154216] [2025-03-08 05:56:10,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:10,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,473 INFO L87 Difference]: Start difference. First operand 651 states and 966 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,619 INFO L93 Difference]: Finished difference Result 1228 states and 1839 transitions. [2025-03-08 05:56:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-03-08 05:56:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,627 INFO L225 Difference]: With dead ends: 1228 [2025-03-08 05:56:10,628 INFO L226 Difference]: Without dead ends: 671 [2025-03-08 05:56:10,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:10,631 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-08 05:56:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 659. [2025-03-08 05:56:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4538310412573674) internal successors, (740), 512 states have internal predecessors, (740), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 974 transitions. [2025-03-08 05:56:10,691 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 974 transitions. Word has length 57 [2025-03-08 05:56:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 974 transitions. [2025-03-08 05:56:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 974 transitions. [2025-03-08 05:56:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 05:56:10,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:56:10,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1959158317, now seen corresponding path program 1 times [2025-03-08 05:56:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489255559] [2025-03-08 05:56:10,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 05:56:10,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 05:56:10,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489255559] [2025-03-08 05:56:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489255559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738828236] [2025-03-08 05:56:10,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:10,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:10,829 INFO L87 Difference]: Start difference. First operand 659 states and 974 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,942 INFO L93 Difference]: Finished difference Result 1216 states and 1819 transitions. [2025-03-08 05:56:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-03-08 05:56:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,946 INFO L225 Difference]: With dead ends: 1216 [2025-03-08 05:56:10,946 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 05:56:10,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,948 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 52 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 640 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 05:56:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-03-08 05:56:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4459724950884087) internal successors, (736), 512 states have internal predecessors, (736), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 970 transitions. [2025-03-08 05:56:10,988 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 970 transitions. Word has length 59 [2025-03-08 05:56:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 970 transitions. [2025-03-08 05:56:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 970 transitions. [2025-03-08 05:56:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:56:10,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:56:10,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 702003061, now seen corresponding path program 1 times [2025-03-08 05:56:10,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902142356] [2025-03-08 05:56:10,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:56:11,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:56:11,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902142356] [2025-03-08 05:56:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902142356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794517457] [2025-03-08 05:56:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,191 INFO L87 Difference]: Start difference. First operand 659 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:56:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,237 INFO L93 Difference]: Finished difference Result 1236 states and 1843 transitions. [2025-03-08 05:56:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-03-08 05:56:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,241 INFO L225 Difference]: With dead ends: 1236 [2025-03-08 05:56:11,241 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 05:56:11,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:11,243 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 740 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 05:56:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-03-08 05:56:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 525 states have (on average 1.4323809523809523) internal successors, (752), 528 states have internal predecessors, (752), 117 states have call successors, (117), 36 states have call predecessors, (117), 36 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 986 transitions. [2025-03-08 05:56:11,278 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 986 transitions. Word has length 60 [2025-03-08 05:56:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 986 transitions. [2025-03-08 05:56:11,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:56:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 986 transitions. [2025-03-08 05:56:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:56:11,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:11,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:56:11,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1822734871, now seen corresponding path program 1 times [2025-03-08 05:56:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068705528] [2025-03-08 05:56:11,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:56:11,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:56:11,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068705528] [2025-03-08 05:56:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068705528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111132880] [2025-03-08 05:56:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,447 INFO L87 Difference]: Start difference. First operand 679 states and 986 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,521 INFO L93 Difference]: Finished difference Result 1276 states and 1887 transitions. [2025-03-08 05:56:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-08 05:56:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,525 INFO L225 Difference]: With dead ends: 1276 [2025-03-08 05:56:11,526 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 05:56:11,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:11,529 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 05:56:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-08 05:56:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 541 states have (on average 1.4195933456561922) internal successors, (768), 544 states have internal predecessors, (768), 117 states have call successors, (117), 40 states have call predecessors, (117), 40 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1002 transitions. [2025-03-08 05:56:11,591 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1002 transitions. Word has length 68 [2025-03-08 05:56:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1002 transitions. [2025-03-08 05:56:11,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1002 transitions. [2025-03-08 05:56:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:56:11,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:11,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:56:11,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1932700925, now seen corresponding path program 1 times [2025-03-08 05:56:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698133456] [2025-03-08 05:56:11,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:56:11,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:56:11,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698133456] [2025-03-08 05:56:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698133456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583757217] [2025-03-08 05:56:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,797 INFO L87 Difference]: Start difference. First operand 699 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,855 INFO L93 Difference]: Finished difference Result 1312 states and 1903 transitions. [2025-03-08 05:56:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-08 05:56:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,861 INFO L225 Difference]: With dead ends: 1312 [2025-03-08 05:56:11,861 INFO L226 Difference]: Without dead ends: 715 [2025-03-08 05:56:11,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:11,864 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-08 05:56:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-08 05:56:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 553 states have (on average 1.410488245931284) internal successors, (780), 556 states have internal predecessors, (780), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1014 transitions. [2025-03-08 05:56:11,915 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1014 transitions. Word has length 76 [2025-03-08 05:56:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,916 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1014 transitions. [2025-03-08 05:56:11,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1014 transitions. [2025-03-08 05:56:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:56:11,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:11,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:56:11,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1300772662, now seen corresponding path program 1 times [2025-03-08 05:56:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750103410] [2025-03-08 05:56:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:56:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:56:11,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750103410] [2025-03-08 05:56:12,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750103410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924170416] [2025-03-08 05:56:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:12,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:12,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:12,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:12,073 INFO L87 Difference]: Start difference. First operand 715 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:12,138 INFO L93 Difference]: Finished difference Result 1348 states and 1943 transitions. [2025-03-08 05:56:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:12,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-08 05:56:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:12,144 INFO L225 Difference]: With dead ends: 1348 [2025-03-08 05:56:12,144 INFO L226 Difference]: Without dead ends: 735 [2025-03-08 05:56:12,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:12,146 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:12,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-08 05:56:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2025-03-08 05:56:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 569 states have (on average 1.398945518453427) internal successors, (796), 572 states have internal predecessors, (796), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1030 transitions. [2025-03-08 05:56:12,182 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1030 transitions. Word has length 76 [2025-03-08 05:56:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:12,183 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1030 transitions. [2025-03-08 05:56:12,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1030 transitions. [2025-03-08 05:56:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:56:12,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:12,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:12,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:56:12,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -911760200, now seen corresponding path program 1 times [2025-03-08 05:56:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967959113] [2025-03-08 05:56:12,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:12,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:56:12,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:56:12,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:12,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967959113] [2025-03-08 05:56:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967959113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:12,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923606324] [2025-03-08 05:56:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:12,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:12,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:12,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:12,343 INFO L87 Difference]: Start difference. First operand 735 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:56:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:12,412 INFO L93 Difference]: Finished difference Result 1392 states and 1971 transitions. [2025-03-08 05:56:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:12,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2025-03-08 05:56:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:12,418 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 05:56:12,418 INFO L226 Difference]: Without dead ends: 759 [2025-03-08 05:56:12,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:12,421 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:12,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 738 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-03-08 05:56:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2025-03-08 05:56:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 589 states have (on average 1.3853989813242784) internal successors, (816), 592 states have internal predecessors, (816), 117 states have call successors, (117), 52 states have call predecessors, (117), 52 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1050 transitions. [2025-03-08 05:56:12,456 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1050 transitions. Word has length 84 [2025-03-08 05:56:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:12,457 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1050 transitions. [2025-03-08 05:56:12,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:56:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1050 transitions. [2025-03-08 05:56:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:56:12,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:12,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:56:12,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:12,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1502649538, now seen corresponding path program 1 times [2025-03-08 05:56:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509222863] [2025-03-08 05:56:12,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:56:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:56:12,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:12,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:56:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509222863] [2025-03-08 05:56:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509222863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125958845] [2025-03-08 05:56:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:12,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:12,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:12,969 INFO L87 Difference]: Start difference. First operand 759 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:56:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:13,203 INFO L93 Difference]: Finished difference Result 1983 states and 2731 transitions. [2025-03-08 05:56:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-03-08 05:56:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:13,211 INFO L225 Difference]: With dead ends: 1983 [2025-03-08 05:56:13,211 INFO L226 Difference]: Without dead ends: 1326 [2025-03-08 05:56:13,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:13,215 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 200 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:13,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1393 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-08 05:56:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 912. [2025-03-08 05:56:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 705 states have (on average 1.374468085106383) internal successors, (969), 709 states have internal predecessors, (969), 141 states have call successors, (141), 65 states have call predecessors, (141), 65 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 05:56:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1251 transitions. [2025-03-08 05:56:13,285 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1251 transitions. Word has length 87 [2025-03-08 05:56:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1251 transitions. [2025-03-08 05:56:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:56:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1251 transitions. [2025-03-08 05:56:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:56:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:13,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:13,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:56:13,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:13,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1983966273, now seen corresponding path program 1 times [2025-03-08 05:56:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005693502] [2025-03-08 05:56:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:56:13,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:56:13,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:13,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:56:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005693502] [2025-03-08 05:56:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005693502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209690898] [2025-03-08 05:56:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:13,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:13,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:13,432 INFO L87 Difference]: Start difference. First operand 912 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:13,503 INFO L93 Difference]: Finished difference Result 1697 states and 2351 transitions. [2025-03-08 05:56:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-03-08 05:56:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:13,509 INFO L225 Difference]: With dead ends: 1697 [2025-03-08 05:56:13,509 INFO L226 Difference]: Without dead ends: 932 [2025-03-08 05:56:13,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:13,511 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:13,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-08 05:56:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2025-03-08 05:56:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 720 states have (on average 1.3666666666666667) internal successors, (984), 724 states have internal predecessors, (984), 141 states have call successors, (141), 70 states have call predecessors, (141), 70 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 05:56:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1266 transitions. [2025-03-08 05:56:13,558 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1266 transitions. Word has length 91 [2025-03-08 05:56:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1266 transitions. [2025-03-08 05:56:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1266 transitions. [2025-03-08 05:56:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:56:13,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:13,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:13,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:56:13,560 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:13,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1856881948, now seen corresponding path program 1 times [2025-03-08 05:56:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:13,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813505861] [2025-03-08 05:56:13,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:13,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:56:13,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:56:13,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813505861] [2025-03-08 05:56:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813505861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184014998] [2025-03-08 05:56:13,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:13,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:13,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:56:13,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:56:13,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:56:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:13,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:56:13,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:56:14,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184014998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-08 05:56:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888875293] [2025-03-08 05:56:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:14,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:56:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:14,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:56:14,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:56:14,057 INFO L87 Difference]: Start difference. First operand 932 states and 1266 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:14,218 INFO L93 Difference]: Finished difference Result 2086 states and 2955 transitions. [2025-03-08 05:56:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:56:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-03-08 05:56:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:14,225 INFO L225 Difference]: With dead ends: 2086 [2025-03-08 05:56:14,225 INFO L226 Difference]: Without dead ends: 1341 [2025-03-08 05:56:14,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:14,227 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 139 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:14,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2777 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-03-08 05:56:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 934. [2025-03-08 05:56:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 720 states have (on average 1.3597222222222223) internal successors, (979), 725 states have internal predecessors, (979), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 137 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-08 05:56:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1263 transitions. [2025-03-08 05:56:14,294 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1263 transitions. Word has length 90 [2025-03-08 05:56:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:14,295 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1263 transitions. [2025-03-08 05:56:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1263 transitions. [2025-03-08 05:56:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:56:14,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:14,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:14,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:56:14,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 62194241, now seen corresponding path program 1 times [2025-03-08 05:56:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85382544] [2025-03-08 05:56:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:56:14,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:56:14,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:56:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85382544] [2025-03-08 05:56:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85382544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237009150] [2025-03-08 05:56:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:14,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:14,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:14,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:14,608 INFO L87 Difference]: Start difference. First operand 934 states and 1263 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:56:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:14,767 INFO L93 Difference]: Finished difference Result 1740 states and 2372 transitions. [2025-03-08 05:56:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2025-03-08 05:56:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:14,773 INFO L225 Difference]: With dead ends: 1740 [2025-03-08 05:56:14,773 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 05:56:14,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:14,775 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 236 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:14,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1435 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 05:56:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 952. [2025-03-08 05:56:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 743 states have (on average 1.3566621803499328) internal successors, (1008), 752 states have internal predecessors, (1008), 136 states have call successors, (136), 72 states have call predecessors, (136), 72 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 05:56:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1280 transitions. [2025-03-08 05:56:14,827 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1280 transitions. Word has length 93 [2025-03-08 05:56:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1280 transitions. [2025-03-08 05:56:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:56:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1280 transitions. [2025-03-08 05:56:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:56:14,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:14,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:56:14,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 916063623, now seen corresponding path program 1 times [2025-03-08 05:56:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845215193] [2025-03-08 05:56:14,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:56:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:56:14,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:56:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845215193] [2025-03-08 05:56:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845215193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:15,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164564673] [2025-03-08 05:56:15,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:15,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:15,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:15,253 INFO L87 Difference]: Start difference. First operand 952 states and 1280 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:15,459 INFO L93 Difference]: Finished difference Result 1725 states and 2334 transitions. [2025-03-08 05:56:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-08 05:56:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:15,469 INFO L225 Difference]: With dead ends: 1725 [2025-03-08 05:56:15,470 INFO L226 Difference]: Without dead ends: 951 [2025-03-08 05:56:15,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:15,472 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 131 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:15,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1511 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-08 05:56:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2025-03-08 05:56:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 735 states have (on average 1.3551020408163266) internal successors, (996), 744 states have internal predecessors, (996), 134 states have call successors, (134), 71 states have call predecessors, (134), 71 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 05:56:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1264 transitions. [2025-03-08 05:56:15,539 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1264 transitions. Word has length 95 [2025-03-08 05:56:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1264 transitions. [2025-03-08 05:56:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1264 transitions. [2025-03-08 05:56:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:56:15,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:15,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:15,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:56:15,541 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:15,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash 854300559, now seen corresponding path program 1 times [2025-03-08 05:56:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:15,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688420004] [2025-03-08 05:56:15,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:15,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:56:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:56:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688420004] [2025-03-08 05:56:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688420004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:15,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258237926] [2025-03-08 05:56:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:15,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:15,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:15,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:15,929 INFO L87 Difference]: Start difference. First operand 941 states and 1264 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,259 INFO L93 Difference]: Finished difference Result 1792 states and 2394 transitions. [2025-03-08 05:56:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2025-03-08 05:56:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,264 INFO L225 Difference]: With dead ends: 1792 [2025-03-08 05:56:16,265 INFO L226 Difference]: Without dead ends: 998 [2025-03-08 05:56:16,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:16,267 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 396 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1205 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-08 05:56:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 957. [2025-03-08 05:56:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 743 states have (on average 1.3310901749663526) internal successors, (989), 753 states have internal predecessors, (989), 137 states have call successors, (137), 76 states have call predecessors, (137), 76 states have return successors, (137), 127 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 05:56:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1263 transitions. [2025-03-08 05:56:16,331 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1263 transitions. Word has length 96 [2025-03-08 05:56:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:16,331 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1263 transitions. [2025-03-08 05:56:16,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1263 transitions. [2025-03-08 05:56:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:56:16,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:16,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:56:16,333 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1834627817, now seen corresponding path program 1 times [2025-03-08 05:56:16,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:16,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198182907] [2025-03-08 05:56:16,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:16,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:56:16,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:56:16,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:16,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198182907] [2025-03-08 05:56:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198182907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:16,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:16,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:16,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966259954] [2025-03-08 05:56:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:16,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:16,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:16,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:16,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:16,413 INFO L87 Difference]: Start difference. First operand 957 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,544 INFO L93 Difference]: Finished difference Result 2528 states and 3355 transitions. [2025-03-08 05:56:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2025-03-08 05:56:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,553 INFO L225 Difference]: With dead ends: 2528 [2025-03-08 05:56:16,553 INFO L226 Difference]: Without dead ends: 1769 [2025-03-08 05:56:16,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:16,556 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 192 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1122 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-03-08 05:56:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1538. [2025-03-08 05:56:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1181 states have (on average 1.3243014394580863) internal successors, (1564), 1197 states have internal predecessors, (1564), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-08 05:56:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2026 transitions. [2025-03-08 05:56:16,659 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2026 transitions. Word has length 97 [2025-03-08 05:56:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:16,660 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2026 transitions. [2025-03-08 05:56:16,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2026 transitions. [2025-03-08 05:56:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:16,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:16,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:16,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:56:16,663 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:16,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1379362924, now seen corresponding path program 1 times [2025-03-08 05:56:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652037304] [2025-03-08 05:56:16,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:16,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:16,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652037304] [2025-03-08 05:56:16,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652037304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:16,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:16,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868524967] [2025-03-08 05:56:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:16,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:16,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:16,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:16,735 INFO L87 Difference]: Start difference. First operand 1538 states and 2026 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,914 INFO L93 Difference]: Finished difference Result 3606 states and 4774 transitions. [2025-03-08 05:56:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,926 INFO L225 Difference]: With dead ends: 3606 [2025-03-08 05:56:16,927 INFO L226 Difference]: Without dead ends: 2349 [2025-03-08 05:56:16,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:16,931 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 193 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1156 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-08 05:56:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2116. [2025-03-08 05:56:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1616 states have (on average 1.318069306930693) internal successors, (2130), 1638 states have internal predecessors, (2130), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-08 05:56:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2780 transitions. [2025-03-08 05:56:17,089 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2780 transitions. Word has length 99 [2025-03-08 05:56:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:17,089 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2780 transitions. [2025-03-08 05:56:17,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2780 transitions. [2025-03-08 05:56:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:17,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:17,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:17,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:56:17,091 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:17,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1146920336, now seen corresponding path program 1 times [2025-03-08 05:56:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479274628] [2025-03-08 05:56:17,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:17,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:17,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:17,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:17,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479274628] [2025-03-08 05:56:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479274628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:17,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792384680] [2025-03-08 05:56:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:17,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:17,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:17,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:17,141 INFO L87 Difference]: Start difference. First operand 2116 states and 2780 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:17,313 INFO L93 Difference]: Finished difference Result 4004 states and 5287 transitions. [2025-03-08 05:56:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:17,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:17,324 INFO L225 Difference]: With dead ends: 4004 [2025-03-08 05:56:17,324 INFO L226 Difference]: Without dead ends: 2125 [2025-03-08 05:56:17,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:17,332 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:17,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2025-03-08 05:56:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2119. [2025-03-08 05:56:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1619 states have (on average 1.317479925880173) internal successors, (2133), 1641 states have internal predecessors, (2133), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-08 05:56:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2783 transitions. [2025-03-08 05:56:17,461 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2783 transitions. Word has length 99 [2025-03-08 05:56:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:17,461 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 2783 transitions. [2025-03-08 05:56:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2783 transitions. [2025-03-08 05:56:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:17,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:17,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:17,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:56:17,464 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:17,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash 699005390, now seen corresponding path program 1 times [2025-03-08 05:56:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929496769] [2025-03-08 05:56:17,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:17,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929496769] [2025-03-08 05:56:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929496769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031146970] [2025-03-08 05:56:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:17,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:17,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:17,853 INFO L87 Difference]: Start difference. First operand 2119 states and 2783 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:18,302 INFO L93 Difference]: Finished difference Result 4395 states and 5769 transitions. [2025-03-08 05:56:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:18,314 INFO L225 Difference]: With dead ends: 4395 [2025-03-08 05:56:18,315 INFO L226 Difference]: Without dead ends: 2649 [2025-03-08 05:56:18,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:18,319 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 400 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:18,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1337 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-03-08 05:56:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2126. [2025-03-08 05:56:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1615 states have (on average 1.3157894736842106) internal successors, (2125), 1638 states have internal predecessors, (2125), 332 states have call successors, (332), 178 states have call predecessors, (332), 178 states have return successors, (332), 309 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-08 05:56:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2789 transitions. [2025-03-08 05:56:18,485 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2789 transitions. Word has length 99 [2025-03-08 05:56:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:18,486 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 2789 transitions. [2025-03-08 05:56:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2789 transitions. [2025-03-08 05:56:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:56:18,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:18,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:18,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:56:18,488 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:18,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2019590063, now seen corresponding path program 1 times [2025-03-08 05:56:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348443062] [2025-03-08 05:56:18,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:18,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:18,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:56:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:56:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348443062] [2025-03-08 05:56:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348443062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094601645] [2025-03-08 05:56:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:18,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:18,563 INFO L87 Difference]: Start difference. First operand 2126 states and 2789 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:18,839 INFO L93 Difference]: Finished difference Result 5315 states and 7008 transitions. [2025-03-08 05:56:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-03-08 05:56:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:18,862 INFO L225 Difference]: With dead ends: 5315 [2025-03-08 05:56:18,862 INFO L226 Difference]: Without dead ends: 3607 [2025-03-08 05:56:18,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:18,867 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 197 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:18,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2025-03-08 05:56:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3376. [2025-03-08 05:56:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 2530 states have (on average 1.3027667984189724) internal successors, (3296), 2567 states have internal predecessors, (3296), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-08 05:56:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4398 transitions. [2025-03-08 05:56:19,128 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4398 transitions. Word has length 101 [2025-03-08 05:56:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:19,128 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4398 transitions. [2025-03-08 05:56:19,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4398 transitions. [2025-03-08 05:56:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:56:19,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:19,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:56:19,132 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:19,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash -73239275, now seen corresponding path program 1 times [2025-03-08 05:56:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:19,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93664456] [2025-03-08 05:56:19,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:19,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:56:19,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:56:19,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:19,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93664456] [2025-03-08 05:56:19,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93664456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:19,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:19,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:19,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913219242] [2025-03-08 05:56:19,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:19,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:19,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:19,253 INFO L87 Difference]: Start difference. First operand 3376 states and 4398 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:19,444 INFO L93 Difference]: Finished difference Result 6404 states and 8364 transitions. [2025-03-08 05:56:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-03-08 05:56:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:19,463 INFO L225 Difference]: With dead ends: 6404 [2025-03-08 05:56:19,463 INFO L226 Difference]: Without dead ends: 3100 [2025-03-08 05:56:19,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:19,472 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 74 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:19,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 725 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-03-08 05:56:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2995. [2025-03-08 05:56:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2226 states have (on average 1.3068283917340522) internal successors, (2909), 2250 states have internal predecessors, (2909), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2025-03-08 05:56:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3913 transitions. [2025-03-08 05:56:19,716 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3913 transitions. Word has length 102 [2025-03-08 05:56:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:19,717 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3913 transitions. [2025-03-08 05:56:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3913 transitions. [2025-03-08 05:56:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:56:19,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:19,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:19,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:56:19,718 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:19,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 451740973, now seen corresponding path program 1 times [2025-03-08 05:56:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:19,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096969387] [2025-03-08 05:56:19,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:19,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:56:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:56:19,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096969387] [2025-03-08 05:56:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096969387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622345279] [2025-03-08 05:56:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:19,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:19,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:19,824 INFO L87 Difference]: Start difference. First operand 2995 states and 3913 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:20,031 INFO L93 Difference]: Finished difference Result 5786 states and 7582 transitions. [2025-03-08 05:56:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-03-08 05:56:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:20,049 INFO L225 Difference]: With dead ends: 5786 [2025-03-08 05:56:20,049 INFO L226 Difference]: Without dead ends: 2910 [2025-03-08 05:56:20,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:20,057 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:20,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-03-08 05:56:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2755. [2025-03-08 05:56:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2045 states have (on average 1.3056234718826405) internal successors, (2670), 2064 states have internal predecessors, (2670), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2025-03-08 05:56:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3598 transitions. [2025-03-08 05:56:20,252 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3598 transitions. Word has length 104 [2025-03-08 05:56:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:20,252 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3598 transitions. [2025-03-08 05:56:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3598 transitions. [2025-03-08 05:56:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 05:56:20,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:20,256 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:56:20,256 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:20,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash -106675050, now seen corresponding path program 1 times [2025-03-08 05:56:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:20,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439227467] [2025-03-08 05:56:20,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:20,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:56:20,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:56:20,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439227467] [2025-03-08 05:56:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439227467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033415433] [2025-03-08 05:56:20,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:20,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:20,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:20,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:20,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:56:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:56:20,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:56:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 05:56:20,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:21,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033415433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:21,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2025-03-08 05:56:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130598008] [2025-03-08 05:56:21,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 05:56:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:21,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 05:56:21,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:56:21,413 INFO L87 Difference]: Start difference. First operand 2755 states and 3598 transitions. Second operand has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-03-08 05:56:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:25,490 INFO L93 Difference]: Finished difference Result 11336 states and 14741 transitions. [2025-03-08 05:56:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-08 05:56:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 153 [2025-03-08 05:56:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:25,527 INFO L225 Difference]: With dead ends: 11336 [2025-03-08 05:56:25,528 INFO L226 Difference]: Without dead ends: 8861 [2025-03-08 05:56:25,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2025-03-08 05:56:25,538 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 5858 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 2246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5858 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2246 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:25,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5858 Valid, 3236 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2246 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 05:56:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8861 states. [2025-03-08 05:56:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8861 to 7357. [2025-03-08 05:56:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7357 states, 5440 states have (on average 1.2987132352941178) internal successors, (7065), 5492 states have internal predecessors, (7065), 1239 states have call successors, (1239), 677 states have call predecessors, (1239), 677 states have return successors, (1239), 1187 states have call predecessors, (1239), 1239 states have call successors, (1239) [2025-03-08 05:56:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 9543 transitions. [2025-03-08 05:56:26,120 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 9543 transitions. Word has length 153 [2025-03-08 05:56:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:26,120 INFO L471 AbstractCegarLoop]: Abstraction has 7357 states and 9543 transitions. [2025-03-08 05:56:26,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 20 states have internal predecessors, (256), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2025-03-08 05:56:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 9543 transitions. [2025-03-08 05:56:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:56:26,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:26,131 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:26,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 05:56:26,336 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1127687556, now seen corresponding path program 1 times [2025-03-08 05:56:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267281287] [2025-03-08 05:56:26,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:56:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:56:26,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:26,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-08 05:56:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:26,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267281287] [2025-03-08 05:56:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267281287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552301941] [2025-03-08 05:56:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:26,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:26,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:26,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:26,492 INFO L87 Difference]: Start difference. First operand 7357 states and 9543 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:56:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:27,625 INFO L93 Difference]: Finished difference Result 21307 states and 27761 transitions. [2025-03-08 05:56:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 156 [2025-03-08 05:56:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:27,682 INFO L225 Difference]: With dead ends: 21307 [2025-03-08 05:56:27,682 INFO L226 Difference]: Without dead ends: 14448 [2025-03-08 05:56:27,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:27,702 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 215 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:27,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2094 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14448 states. [2025-03-08 05:56:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14448 to 12234. [2025-03-08 05:56:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12234 states, 8953 states have (on average 1.2957667820842176) internal successors, (11601), 9043 states have internal predecessors, (11601), 2141 states have call successors, (2141), 1139 states have call predecessors, (2141), 1139 states have return successors, (2141), 2051 states have call predecessors, (2141), 2141 states have call successors, (2141) [2025-03-08 05:56:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 15883 transitions. [2025-03-08 05:56:28,815 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 15883 transitions. Word has length 156 [2025-03-08 05:56:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:28,816 INFO L471 AbstractCegarLoop]: Abstraction has 12234 states and 15883 transitions. [2025-03-08 05:56:28,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:56:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 15883 transitions. [2025-03-08 05:56:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:56:28,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:28,833 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 05:56:28,833 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:28,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 765909883, now seen corresponding path program 1 times [2025-03-08 05:56:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758566930] [2025-03-08 05:56:28,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:56:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:56:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:28,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:56:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758566930] [2025-03-08 05:56:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758566930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307954119] [2025-03-08 05:56:29,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:29,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:29,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:56:29,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:56:29,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:56:29,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:29,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:29,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:56:29,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:56:29,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307954119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:29,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:29,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-08 05:56:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580833549] [2025-03-08 05:56:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:29,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:29,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:56:29,921 INFO L87 Difference]: Start difference. First operand 12234 states and 15883 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:56:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:30,867 INFO L93 Difference]: Finished difference Result 21046 states and 27383 transitions. [2025-03-08 05:56:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 156 [2025-03-08 05:56:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:30,918 INFO L225 Difference]: With dead ends: 21046 [2025-03-08 05:56:30,918 INFO L226 Difference]: Without dead ends: 8950 [2025-03-08 05:56:30,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:56:30,942 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 3 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:30,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1430 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2025-03-08 05:56:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 7447. [2025-03-08 05:56:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7447 states, 5476 states have (on average 1.2983929875821767) internal successors, (7110), 5525 states have internal predecessors, (7110), 1290 states have call successors, (1290), 680 states have call predecessors, (1290), 680 states have return successors, (1290), 1241 states have call predecessors, (1290), 1290 states have call successors, (1290) [2025-03-08 05:56:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7447 states to 7447 states and 9690 transitions. [2025-03-08 05:56:31,662 INFO L78 Accepts]: Start accepts. Automaton has 7447 states and 9690 transitions. Word has length 156 [2025-03-08 05:56:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:31,662 INFO L471 AbstractCegarLoop]: Abstraction has 7447 states and 9690 transitions. [2025-03-08 05:56:31,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:56:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7447 states and 9690 transitions. [2025-03-08 05:56:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:56:31,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:31,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:31,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 05:56:31,879 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:31,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1892171577, now seen corresponding path program 1 times [2025-03-08 05:56:31,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060637695] [2025-03-08 05:56:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:31,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:31,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:56:31,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:56:31,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:56:32,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060637695] [2025-03-08 05:56:32,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060637695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124885855] [2025-03-08 05:56:32,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:32,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:32,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:32,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:56:32,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:56:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:56:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:32,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 05:56:32,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:33,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124885855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:33,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 28 [2025-03-08 05:56:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607435305] [2025-03-08 05:56:33,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:33,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:56:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:33,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:56:33,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:56:33,877 INFO L87 Difference]: Start difference. First operand 7447 states and 9690 transitions. Second operand has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-08 05:56:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:37,204 INFO L93 Difference]: Finished difference Result 21748 states and 28209 transitions. [2025-03-08 05:56:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 05:56:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) Word has length 157 [2025-03-08 05:56:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:37,265 INFO L225 Difference]: With dead ends: 21748 [2025-03-08 05:56:37,265 INFO L226 Difference]: Without dead ends: 14579 [2025-03-08 05:56:37,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=583, Invalid=3449, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 05:56:37,286 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1391 mSDsluCounter, 6659 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:37,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 7234 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:56:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2025-03-08 05:56:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 9558. [2025-03-08 05:56:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9558 states, 7003 states have (on average 1.297158360702556) internal successors, (9084), 7072 states have internal predecessors, (9084), 1662 states have call successors, (1662), 892 states have call predecessors, (1662), 892 states have return successors, (1662), 1593 states have call predecessors, (1662), 1662 states have call successors, (1662) [2025-03-08 05:56:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 12408 transitions. [2025-03-08 05:56:38,184 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 12408 transitions. Word has length 157 [2025-03-08 05:56:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:38,185 INFO L471 AbstractCegarLoop]: Abstraction has 9558 states and 12408 transitions. [2025-03-08 05:56:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.925925925925926) internal successors, (241), 26 states have internal predecessors, (241), 8 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 8 states have call successors, (35) [2025-03-08 05:56:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 12408 transitions. [2025-03-08 05:56:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:56:38,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:38,194 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:38,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:56:38,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:38,395 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:38,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash -334587595, now seen corresponding path program 1 times [2025-03-08 05:56:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67454391] [2025-03-08 05:56:38,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:38,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:56:38,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:56:38,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:38,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:56:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67454391] [2025-03-08 05:56:39,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67454391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116008024] [2025-03-08 05:56:39,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:39,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:39,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:39,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:39,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:56:39,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:56:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:56:40,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:40,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:56:40,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:56:40,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 05:56:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116008024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:40,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2025-03-08 05:56:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096175544] [2025-03-08 05:56:40,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:40,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:56:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:40,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:56:40,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:40,231 INFO L87 Difference]: Start difference. First operand 9558 states and 12408 transitions. Second operand has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) [2025-03-08 05:56:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:42,861 INFO L93 Difference]: Finished difference Result 20314 states and 26301 transitions. [2025-03-08 05:56:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 05:56:42,861 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) Word has length 166 [2025-03-08 05:56:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:42,906 INFO L225 Difference]: With dead ends: 20314 [2025-03-08 05:56:42,906 INFO L226 Difference]: Without dead ends: 10970 [2025-03-08 05:56:42,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=614, Invalid=2692, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 05:56:42,924 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2140 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:42,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 2444 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:56:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10970 states. [2025-03-08 05:56:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10970 to 10500. [2025-03-08 05:56:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10500 states, 7689 states have (on average 1.2953570035115098) internal successors, (9960), 7766 states have internal predecessors, (9960), 1826 states have call successors, (1826), 984 states have call predecessors, (1826), 984 states have return successors, (1826), 1749 states have call predecessors, (1826), 1826 states have call successors, (1826) [2025-03-08 05:56:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 13612 transitions. [2025-03-08 05:56:44,158 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 13612 transitions. Word has length 166 [2025-03-08 05:56:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 10500 states and 13612 transitions. [2025-03-08 05:56:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 17 states have internal predecessors, (205), 7 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 8 states have call predecessors, (38), 7 states have call successors, (38) [2025-03-08 05:56:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 13612 transitions. [2025-03-08 05:56:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 05:56:44,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:44,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:44,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:44,370 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1136638543, now seen corresponding path program 1 times [2025-03-08 05:56:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135086330] [2025-03-08 05:56:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:44,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:56:44,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:56:44,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:44,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135086330] [2025-03-08 05:56:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135086330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849064553] [2025-03-08 05:56:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:44,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:44,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:44,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:56:44,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:56:45,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:56:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:45,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 05:56:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 64 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:56:45,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849064553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:45,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2025-03-08 05:56:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007392301] [2025-03-08 05:56:45,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:56:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:56:45,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:45,820 INFO L87 Difference]: Start difference. First operand 10500 states and 13612 transitions. Second operand has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 05:56:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:48,738 INFO L93 Difference]: Finished difference Result 25875 states and 33666 transitions. [2025-03-08 05:56:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 05:56:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 175 [2025-03-08 05:56:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:48,799 INFO L225 Difference]: With dead ends: 25875 [2025-03-08 05:56:48,799 INFO L226 Difference]: Without dead ends: 15694 [2025-03-08 05:56:48,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 05:56:48,817 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1236 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:48,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3213 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:56:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15694 states. [2025-03-08 05:56:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15694 to 15495. [2025-03-08 05:56:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15495 states, 11427 states have (on average 1.2966657915463375) internal successors, (14817), 11536 states have internal predecessors, (14817), 2626 states have call successors, (2626), 1441 states have call predecessors, (2626), 1441 states have return successors, (2626), 2517 states have call predecessors, (2626), 2626 states have call successors, (2626) [2025-03-08 05:56:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 20069 transitions. [2025-03-08 05:56:51,165 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 20069 transitions. Word has length 175 [2025-03-08 05:56:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 15495 states and 20069 transitions. [2025-03-08 05:56:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.11111111111111) internal successors, (236), 18 states have internal predecessors, (236), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 05:56:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 20069 transitions. [2025-03-08 05:56:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 05:56:51,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:51,177 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:51,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:51,378 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -787468275, now seen corresponding path program 1 times [2025-03-08 05:56:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166809112] [2025-03-08 05:56:51,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:51,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:56:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:56:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166809112] [2025-03-08 05:56:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166809112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535398702] [2025-03-08 05:56:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:51,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:51,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:56:52,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:56:52,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:56:52,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:52,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:52,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 05:56:52,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:56:52,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:56:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535398702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:52,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 26 [2025-03-08 05:56:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946163225] [2025-03-08 05:56:52,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:52,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:56:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:56:52,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:56:52,575 INFO L87 Difference]: Start difference. First operand 15495 states and 20069 transitions. Second operand has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 05:56:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:58,705 INFO L93 Difference]: Finished difference Result 44971 states and 59735 transitions. [2025-03-08 05:56:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-08 05:56:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) Word has length 175 [2025-03-08 05:56:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:58,850 INFO L225 Difference]: With dead ends: 44971 [2025-03-08 05:56:58,850 INFO L226 Difference]: Without dead ends: 29464 [2025-03-08 05:56:58,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=863, Invalid=5299, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 05:56:58,889 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1498 mSDsluCounter, 8824 mSDsCounter, 0 mSdLazyCounter, 3303 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 9487 SdHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 3303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:58,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 9487 Invalid, 3926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 3303 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:56:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29464 states. [2025-03-08 05:57:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29464 to 17783. [2025-03-08 05:57:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17783 states, 13067 states have (on average 1.294099640315298) internal successors, (16910), 13200 states have internal predecessors, (16910), 3042 states have call successors, (3042), 1673 states have call predecessors, (3042), 1673 states have return successors, (3042), 2909 states have call predecessors, (3042), 3042 states have call successors, (3042) [2025-03-08 05:57:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17783 states to 17783 states and 22994 transitions. [2025-03-08 05:57:01,836 INFO L78 Accepts]: Start accepts. Automaton has 17783 states and 22994 transitions. Word has length 175 [2025-03-08 05:57:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:01,837 INFO L471 AbstractCegarLoop]: Abstraction has 17783 states and 22994 transitions. [2025-03-08 05:57:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.846153846153847) internal successors, (230), 22 states have internal predecessors, (230), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 05:57:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17783 states and 22994 transitions. [2025-03-08 05:57:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:57:01,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:01,855 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:01,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:57:02,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:02,056 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1890313517, now seen corresponding path program 1 times [2025-03-08 05:57:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:02,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756100697] [2025-03-08 05:57:02,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:02,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:02,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:02,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:02,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756100697] [2025-03-08 05:57:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756100697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041118864] [2025-03-08 05:57:02,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:02,806 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:02,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:57:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:02,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:03,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 05:57:03,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:57:03,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:04,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041118864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:04,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:04,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2025-03-08 05:57:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509112165] [2025-03-08 05:57:04,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:04,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:57:04,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:04,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:57:04,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:57:04,501 INFO L87 Difference]: Start difference. First operand 17783 states and 22994 transitions. Second operand has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-03-08 05:57:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:09,500 INFO L93 Difference]: Finished difference Result 35519 states and 46041 transitions. [2025-03-08 05:57:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 05:57:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 183 [2025-03-08 05:57:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:09,576 INFO L225 Difference]: With dead ends: 35519 [2025-03-08 05:57:09,577 INFO L226 Difference]: Without dead ends: 18055 [2025-03-08 05:57:09,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=956, Invalid=3874, Unknown=0, NotChecked=0, Total=4830 [2025-03-08 05:57:09,609 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 3463 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 1250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3463 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1250 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:09,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3463 Valid, 2408 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1250 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:57:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18055 states. [2025-03-08 05:57:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18055 to 17867. [2025-03-08 05:57:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17867 states, 13143 states have (on average 1.2927794263105836) internal successors, (16991), 13276 states have internal predecessors, (16991), 3046 states have call successors, (3046), 1677 states have call predecessors, (3046), 1677 states have return successors, (3046), 2913 states have call predecessors, (3046), 3046 states have call successors, (3046) [2025-03-08 05:57:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17867 states to 17867 states and 23083 transitions. [2025-03-08 05:57:12,154 INFO L78 Accepts]: Start accepts. Automaton has 17867 states and 23083 transitions. Word has length 183 [2025-03-08 05:57:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 17867 states and 23083 transitions. [2025-03-08 05:57:12,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-03-08 05:57:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17867 states and 23083 transitions. [2025-03-08 05:57:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:57:12,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:12,164 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:12,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:57:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 05:57:12,369 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -526494204, now seen corresponding path program 1 times [2025-03-08 05:57:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332543225] [2025-03-08 05:57:12,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:12,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:12,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:12,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:12,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332543225] [2025-03-08 05:57:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332543225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408155883] [2025-03-08 05:57:12,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:12,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:12,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:57:12,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:13,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:13,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 05:57:13,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 77 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:57:13,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408155883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:13,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2025-03-08 05:57:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390542497] [2025-03-08 05:57:13,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:13,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 05:57:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:13,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 05:57:13,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:57:13,783 INFO L87 Difference]: Start difference. First operand 17867 states and 23083 transitions. Second operand has 22 states, 22 states have (on average 11.590909090909092) internal successors, (255), 21 states have internal predecessors, (255), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-08 05:57:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:17,468 INFO L93 Difference]: Finished difference Result 38745 states and 50199 transitions. [2025-03-08 05:57:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:57:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.590909090909092) internal successors, (255), 21 states have internal predecessors, (255), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) Word has length 183 [2025-03-08 05:57:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:17,552 INFO L225 Difference]: With dead ends: 38745 [2025-03-08 05:57:17,552 INFO L226 Difference]: Without dead ends: 21197 [2025-03-08 05:57:17,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 05:57:17,589 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1903 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:17,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 3391 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:57:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21197 states. [2025-03-08 05:57:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21197 to 21059. [2025-03-08 05:57:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21059 states, 15475 states have (on average 1.292794830371567) internal successors, (20006), 15633 states have internal predecessors, (20006), 3608 states have call successors, (3608), 1975 states have call predecessors, (3608), 1975 states have return successors, (3608), 3450 states have call predecessors, (3608), 3608 states have call successors, (3608) [2025-03-08 05:57:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21059 states to 21059 states and 27222 transitions. [2025-03-08 05:57:20,871 INFO L78 Accepts]: Start accepts. Automaton has 21059 states and 27222 transitions. Word has length 183 [2025-03-08 05:57:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:20,872 INFO L471 AbstractCegarLoop]: Abstraction has 21059 states and 27222 transitions. [2025-03-08 05:57:20,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.590909090909092) internal successors, (255), 21 states have internal predecessors, (255), 8 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 9 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-08 05:57:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21059 states and 27222 transitions. [2025-03-08 05:57:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:57:20,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:20,880 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:20,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:57:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 05:57:21,081 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash 415827574, now seen corresponding path program 1 times [2025-03-08 05:57:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407318254] [2025-03-08 05:57:21,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:21,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:21,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:21,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:21,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:57:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407318254] [2025-03-08 05:57:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407318254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726264211] [2025-03-08 05:57:21,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:21,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:21,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:21,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:21,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:57:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 05:57:21,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:57:21,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 05:57:21,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:57:21,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 05:57:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726264211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:22,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2025-03-08 05:57:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127551996] [2025-03-08 05:57:22,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 05:57:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:22,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 05:57:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:57:22,139 INFO L87 Difference]: Start difference. First operand 21059 states and 27222 transitions. Second operand has 22 states, 22 states have (on average 11.909090909090908) internal successors, (262), 19 states have internal predecessors, (262), 7 states have call successors, (46), 4 states have call predecessors, (46), 8 states have return successors, (46), 10 states have call predecessors, (46), 7 states have call successors, (46)