./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 38bd35bc88609e3ab03fd0664ba55e28973f1f4c4d5b4f19ae2a936fbd22c96e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:37:07,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:37:07,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:37:07,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:37:07,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:37:07,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:37:07,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:37:07,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:37:07,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:37:07,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:37:07,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:37:07,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:37:07,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:37:07,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:37:07,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:37:07,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:37:07,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:07,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:37:07,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:37:07,642 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38bd35bc88609e3ab03fd0664ba55e28973f1f4c4d5b4f19ae2a936fbd22c96e [2025-03-16 22:37:07,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:37:07,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:37:07,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:37:07,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:37:07,881 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:37:07,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c [2025-03-16 22:37:09,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfa5db85/97432d8331da48b9976f70f4f0bb84f0/FLAGf8ad7aeb6 [2025-03-16 22:37:09,288 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:37:09,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c [2025-03-16 22:37:09,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfa5db85/97432d8331da48b9976f70f4f0bb84f0/FLAGf8ad7aeb6 [2025-03-16 22:37:09,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfa5db85/97432d8331da48b9976f70f4f0bb84f0 [2025-03-16 22:37:09,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:37:09,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:37:09,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:09,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:37:09,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:37:09,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b07ac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09, skipping insertion in model container [2025-03-16 22:37:09,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:37:09,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c[1251,1264] [2025-03-16 22:37:09,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:09,585 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:37:09,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c[1251,1264] [2025-03-16 22:37:09,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:09,683 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:37:09,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09 WrapperNode [2025-03-16 22:37:09,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:09,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:09,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:37:09,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:37:09,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,837 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1299 [2025-03-16 22:37:09,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:09,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:37:09,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:37:09,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:37:09,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,920 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-16 22:37:09,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:09,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:10,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:10,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:10,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:37:10,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:37:10,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:37:10,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:37:10,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (1/1) ... [2025-03-16 22:37:10,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:10,056 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-16 22:37:10,058 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-16 22:37:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:37:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:37:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:37:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:37:10,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:37:10,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:37:11,289 INFO L? ?]: Removed 796 outVars from TransFormulas that were not future-live. [2025-03-16 22:37:11,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:37:11,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:37:11,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:37:11,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:11 BoogieIcfgContainer [2025-03-16 22:37:11,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:37:11,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:37:11,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:37:11,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:37:11,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:37:09" (1/3) ... [2025-03-16 22:37:11,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384b842b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:11, skipping insertion in model container [2025-03-16 22:37:11,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:09" (2/3) ... [2025-03-16 22:37:11,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384b842b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:11, skipping insertion in model container [2025-03-16 22:37:11,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:11" (3/3) ... [2025-03-16 22:37:11,370 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_sym_ex_v.c [2025-03-16 22:37:11,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:37:11,383 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_sym_ex_v.c that has 1 procedures, 380 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:37:11,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:37:11,452 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;@f7919cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:37:11,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:37:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 380 states, 378 states have (on average 1.5) internal successors, (567), 379 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:37:11,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:11,463 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] [2025-03-16 22:37:11,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 519671192, now seen corresponding path program 1 times [2025-03-16 22:37:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612939829] [2025-03-16 22:37:11,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:37:11,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:37:11,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:11,912 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-16 22:37:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612939829] [2025-03-16 22:37:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612939829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61514519] [2025-03-16 22:37:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:11,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:37:11,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:11,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:37:11,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:11,931 INFO L87 Difference]: Start difference. First operand has 380 states, 378 states have (on average 1.5) internal successors, (567), 379 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:12,138 INFO L93 Difference]: Finished difference Result 715 states and 1069 transitions. [2025-03-16 22:37:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:12,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 22:37:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:12,149 INFO L225 Difference]: With dead ends: 715 [2025-03-16 22:37:12,149 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 22:37:12,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:12,156 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:12,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1402 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 22:37:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-16 22:37:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.4934036939313984) internal successors, (566), 379 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 566 transitions. [2025-03-16 22:37:12,205 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 566 transitions. Word has length 36 [2025-03-16 22:37:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:12,205 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 566 transitions. [2025-03-16 22:37:12,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 566 transitions. [2025-03-16 22:37:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 22:37:12,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:12,206 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] [2025-03-16 22:37:12,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:37:12,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:12,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1065382550, now seen corresponding path program 1 times [2025-03-16 22:37:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132306239] [2025-03-16 22:37:12,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:12,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:37:12,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:37:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:12,379 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-16 22:37:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132306239] [2025-03-16 22:37:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132306239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:12,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408457029] [2025-03-16 22:37:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:37:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:12,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:37:12,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:12,383 INFO L87 Difference]: Start difference. First operand 380 states and 566 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:12,569 INFO L93 Difference]: Finished difference Result 717 states and 1068 transitions. [2025-03-16 22:37:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 22:37:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:12,573 INFO L225 Difference]: With dead ends: 717 [2025-03-16 22:37:12,574 INFO L226 Difference]: Without dead ends: 382 [2025-03-16 22:37:12,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:12,576 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:12,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1399 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-16 22:37:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-16 22:37:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4908136482939633) internal successors, (568), 381 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 568 transitions. [2025-03-16 22:37:12,592 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 568 transitions. Word has length 37 [2025-03-16 22:37:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:12,592 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 568 transitions. [2025-03-16 22:37:12,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 568 transitions. [2025-03-16 22:37:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 22:37:12,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:12,593 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] [2025-03-16 22:37:12,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:37:12,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1030578221, now seen corresponding path program 1 times [2025-03-16 22:37:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616585393] [2025-03-16 22:37:12,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 22:37:12,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 22:37:12,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:12,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:12,801 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-16 22:37:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616585393] [2025-03-16 22:37:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616585393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625563649] [2025-03-16 22:37:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:12,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:12,802 INFO L87 Difference]: Start difference. First operand 382 states and 568 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,075 INFO L93 Difference]: Finished difference Result 1026 states and 1527 transitions. [2025-03-16 22:37:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 22:37:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,078 INFO L225 Difference]: With dead ends: 1026 [2025-03-16 22:37:13,078 INFO L226 Difference]: Without dead ends: 689 [2025-03-16 22:37:13,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 22:37:13,079 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1449 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1368 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-16 22:37:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 396. [2025-03-16 22:37:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4886075949367088) internal successors, (588), 395 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 588 transitions. [2025-03-16 22:37:13,096 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 588 transitions. Word has length 38 [2025-03-16 22:37:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,096 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 588 transitions. [2025-03-16 22:37:13,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 588 transitions. [2025-03-16 22:37:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 22:37:13,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:13,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:37:13,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash -718905999, now seen corresponding path program 1 times [2025-03-16 22:37:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576909445] [2025-03-16 22:37:13,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 22:37:14,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 22:37:14,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576909445] [2025-03-16 22:37:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576909445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701958544] [2025-03-16 22:37:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:14,986 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-16 22:37:14,987 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-16 22:37:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 22:37:15,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 22:37:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:15,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:37:15,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:15,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701958544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:37:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-16 22:37:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027011437] [2025-03-16 22:37:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:15,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:15,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:37:15,621 INFO L87 Difference]: Start difference. First operand 396 states and 588 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:15,980 INFO L93 Difference]: Finished difference Result 1001 states and 1489 transitions. [2025-03-16 22:37:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-03-16 22:37:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:15,982 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 22:37:15,982 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 22:37:15,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:15,983 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 1360 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1195 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 22:37:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 415. [2025-03-16 22:37:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.4806763285024154) internal successors, (613), 414 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 613 transitions. [2025-03-16 22:37:15,997 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 613 transitions. Word has length 205 [2025-03-16 22:37:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:15,998 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 613 transitions. [2025-03-16 22:37:15,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 613 transitions. [2025-03-16 22:37:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 22:37:15,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:15,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:16,009 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-16 22:37:16,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:16,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash 382236240, now seen corresponding path program 1 times [2025-03-16 22:37:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:16,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281464671] [2025-03-16 22:37:16,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:16,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 22:37:16,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 22:37:16,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:16,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281464671] [2025-03-16 22:37:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281464671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077238440] [2025-03-16 22:37:17,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:17,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:17,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:17,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:17,513 INFO L87 Difference]: Start difference. First operand 415 states and 613 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:17,786 INFO L93 Difference]: Finished difference Result 1001 states and 1487 transitions. [2025-03-16 22:37:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-16 22:37:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:17,789 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 22:37:17,790 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 22:37:17,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:17,793 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1737 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:17,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 1366 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 22:37:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 446. [2025-03-16 22:37:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4786516853932585) internal successors, (658), 445 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 658 transitions. [2025-03-16 22:37:17,804 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 658 transitions. Word has length 206 [2025-03-16 22:37:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:17,805 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 658 transitions. [2025-03-16 22:37:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 658 transitions. [2025-03-16 22:37:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 22:37:17,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:17,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:37:17,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -817708795, now seen corresponding path program 1 times [2025-03-16 22:37:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932624388] [2025-03-16 22:37:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 22:37:18,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 22:37:18,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:18,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932624388] [2025-03-16 22:37:18,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932624388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:18,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117746638] [2025-03-16 22:37:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:18,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:18,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:18,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:18,957 INFO L87 Difference]: Start difference. First operand 446 states and 658 transitions. Second operand has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:19,221 INFO L93 Difference]: Finished difference Result 1001 states and 1485 transitions. [2025-03-16 22:37:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:19,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-16 22:37:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:19,223 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 22:37:19,223 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 22:37:19,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:19,224 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1702 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:19,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 22:37:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 505. [2025-03-16 22:37:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4781746031746033) internal successors, (745), 504 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 745 transitions. [2025-03-16 22:37:19,239 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 745 transitions. Word has length 208 [2025-03-16 22:37:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:19,239 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 745 transitions. [2025-03-16 22:37:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 745 transitions. [2025-03-16 22:37:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 22:37:19,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:19,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:19,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:37:19,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:19,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1808405649, now seen corresponding path program 1 times [2025-03-16 22:37:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070623647] [2025-03-16 22:37:19,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:19,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 22:37:19,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 22:37:19,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:19,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:20,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:20,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070623647] [2025-03-16 22:37:20,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070623647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:20,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:20,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223938826] [2025-03-16 22:37:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:20,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:20,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:20,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:20,351 INFO L87 Difference]: Start difference. First operand 505 states and 745 transitions. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:20,614 INFO L93 Difference]: Finished difference Result 1001 states and 1484 transitions. [2025-03-16 22:37:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-16 22:37:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:20,617 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 22:37:20,617 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 22:37:20,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:20,618 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1682 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:20,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 1365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 22:37:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 537. [2025-03-16 22:37:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4776119402985075) internal successors, (792), 536 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 792 transitions. [2025-03-16 22:37:20,627 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 792 transitions. Word has length 209 [2025-03-16 22:37:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 792 transitions. [2025-03-16 22:37:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 792 transitions. [2025-03-16 22:37:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 22:37:20,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:20,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:20,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:37:20,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 699857773, now seen corresponding path program 1 times [2025-03-16 22:37:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281863892] [2025-03-16 22:37:20,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:20,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 22:37:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 22:37:20,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:20,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281863892] [2025-03-16 22:37:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281863892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394407604] [2025-03-16 22:37:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:21,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:21,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:21,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:21,415 INFO L87 Difference]: Start difference. First operand 537 states and 792 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:21,674 INFO L93 Difference]: Finished difference Result 1001 states and 1483 transitions. [2025-03-16 22:37:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-16 22:37:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:21,677 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 22:37:21,677 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 22:37:21,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:21,680 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1268 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:21,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 22:37:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 569. [2025-03-16 22:37:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.477112676056338) internal successors, (839), 568 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 839 transitions. [2025-03-16 22:37:21,689 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 839 transitions. Word has length 210 [2025-03-16 22:37:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 839 transitions. [2025-03-16 22:37:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 839 transitions. [2025-03-16 22:37:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 22:37:21,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:21,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:21,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:37:21,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:21,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash -403298217, now seen corresponding path program 1 times [2025-03-16 22:37:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524780424] [2025-03-16 22:37:21,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 22:37:22,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 22:37:22,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:22,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524780424] [2025-03-16 22:37:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524780424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104465558] [2025-03-16 22:37:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:22,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:22,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:22,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:22,516 INFO L87 Difference]: Start difference. First operand 569 states and 839 transitions. Second operand has 7 states, 7 states have (on average 30.142857142857142) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:22,858 INFO L93 Difference]: Finished difference Result 1035 states and 1532 transitions. [2025-03-16 22:37:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:22,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.142857142857142) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-16 22:37:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:22,862 INFO L225 Difference]: With dead ends: 1035 [2025-03-16 22:37:22,862 INFO L226 Difference]: Without dead ends: 672 [2025-03-16 22:37:22,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:22,863 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1304 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:22,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 2145 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-16 22:37:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 571. [2025-03-16 22:37:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.475438596491228) internal successors, (841), 570 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 841 transitions. [2025-03-16 22:37:22,875 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 841 transitions. Word has length 211 [2025-03-16 22:37:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:22,876 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 841 transitions. [2025-03-16 22:37:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.142857142857142) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 841 transitions. [2025-03-16 22:37:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 22:37:22,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:22,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:37:22,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1623707600, now seen corresponding path program 1 times [2025-03-16 22:37:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53213718] [2025-03-16 22:37:22,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:22,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 22:37:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 22:37:23,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53213718] [2025-03-16 22:37:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53213718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:23,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:23,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282251705] [2025-03-16 22:37:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:23,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:23,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:23,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:23,951 INFO L87 Difference]: Start difference. First operand 571 states and 841 transitions. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:24,277 INFO L93 Difference]: Finished difference Result 1011 states and 1496 transitions. [2025-03-16 22:37:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-03-16 22:37:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:24,280 INFO L225 Difference]: With dead ends: 1011 [2025-03-16 22:37:24,280 INFO L226 Difference]: Without dead ends: 674 [2025-03-16 22:37:24,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:24,281 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1268 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:24,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2145 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-16 22:37:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 574. [2025-03-16 22:37:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4746945898778359) internal successors, (845), 573 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 845 transitions. [2025-03-16 22:37:24,290 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 845 transitions. Word has length 212 [2025-03-16 22:37:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:24,291 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 845 transitions. [2025-03-16 22:37:24,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 7 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 845 transitions. [2025-03-16 22:37:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 22:37:24,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:24,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:24,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:37:24,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1239883975, now seen corresponding path program 1 times [2025-03-16 22:37:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894665665] [2025-03-16 22:37:24,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:24,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 22:37:24,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 22:37:24,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:24,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894665665] [2025-03-16 22:37:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894665665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330407484] [2025-03-16 22:37:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:25,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:25,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:25,029 INFO L87 Difference]: Start difference. First operand 574 states and 845 transitions. Second operand has 6 states, 6 states have (on average 35.5) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:25,317 INFO L93 Difference]: Finished difference Result 1036 states and 1531 transitions. [2025-03-16 22:37:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.5) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-03-16 22:37:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:25,320 INFO L225 Difference]: With dead ends: 1036 [2025-03-16 22:37:25,320 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 22:37:25,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:25,321 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1348 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:25,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1822 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 22:37:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 572. [2025-03-16 22:37:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4746059544658494) internal successors, (842), 571 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 842 transitions. [2025-03-16 22:37:25,331 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 842 transitions. Word has length 213 [2025-03-16 22:37:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:25,331 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 842 transitions. [2025-03-16 22:37:25,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.5) internal successors, (213), 5 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:25,331 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 842 transitions. [2025-03-16 22:37:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 22:37:25,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:25,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:37:25,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:25,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 652372206, now seen corresponding path program 1 times [2025-03-16 22:37:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046535852] [2025-03-16 22:37:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:25,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 22:37:25,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 22:37:25,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:25,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:26,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:26,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046535852] [2025-03-16 22:37:26,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046535852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:26,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:26,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233858579] [2025-03-16 22:37:26,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:26,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:26,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:26,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:26,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:26,074 INFO L87 Difference]: Start difference. First operand 572 states and 842 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:26,326 INFO L93 Difference]: Finished difference Result 1003 states and 1483 transitions. [2025-03-16 22:37:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-03-16 22:37:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:26,329 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 22:37:26,329 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 22:37:26,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:26,330 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1229 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:26,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 22:37:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 635. [2025-03-16 22:37:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.474763406940063) internal successors, (935), 634 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 935 transitions. [2025-03-16 22:37:26,341 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 935 transitions. Word has length 213 [2025-03-16 22:37:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 935 transitions. [2025-03-16 22:37:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 935 transitions. [2025-03-16 22:37:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 22:37:26,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:26,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:37:26,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1889719622, now seen corresponding path program 1 times [2025-03-16 22:37:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955319253] [2025-03-16 22:37:26,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:26,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 22:37:26,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 22:37:26,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:26,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:27,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955319253] [2025-03-16 22:37:27,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955319253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:27,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:27,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:27,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074368389] [2025-03-16 22:37:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:27,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:27,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:27,123 INFO L87 Difference]: Start difference. First operand 635 states and 935 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:27,364 INFO L93 Difference]: Finished difference Result 1006 states and 1487 transitions. [2025-03-16 22:37:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-16 22:37:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:27,367 INFO L225 Difference]: With dead ends: 1006 [2025-03-16 22:37:27,367 INFO L226 Difference]: Without dead ends: 669 [2025-03-16 22:37:27,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:27,368 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1216 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:27,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1362 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-16 22:37:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2025-03-16 22:37:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4744744744744744) internal successors, (982), 666 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 982 transitions. [2025-03-16 22:37:27,378 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 982 transitions. Word has length 214 [2025-03-16 22:37:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:27,378 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 982 transitions. [2025-03-16 22:37:27,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 982 transitions. [2025-03-16 22:37:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 22:37:27,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:27,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:37:27,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1392762602, now seen corresponding path program 1 times [2025-03-16 22:37:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119200356] [2025-03-16 22:37:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:27,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 22:37:27,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 22:37:27,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:28,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119200356] [2025-03-16 22:37:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119200356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372259612] [2025-03-16 22:37:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:28,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:28,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:28,056 INFO L87 Difference]: Start difference. First operand 667 states and 982 transitions. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:28,343 INFO L93 Difference]: Finished difference Result 1164 states and 1717 transitions. [2025-03-16 22:37:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-03-16 22:37:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:28,345 INFO L225 Difference]: With dead ends: 1164 [2025-03-16 22:37:28,345 INFO L226 Difference]: Without dead ends: 667 [2025-03-16 22:37:28,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:28,346 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1344 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:28,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1822 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-16 22:37:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-16 22:37:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.472972972972973) internal successors, (981), 666 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 981 transitions. [2025-03-16 22:37:28,356 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 981 transitions. Word has length 215 [2025-03-16 22:37:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:28,356 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 981 transitions. [2025-03-16 22:37:28,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 981 transitions. [2025-03-16 22:37:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 22:37:28,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:28,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:37:28,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:28,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -687020444, now seen corresponding path program 1 times [2025-03-16 22:37:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:28,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524359473] [2025-03-16 22:37:28,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:28,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 22:37:28,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 22:37:28,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:28,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524359473] [2025-03-16 22:37:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524359473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159407365] [2025-03-16 22:37:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:29,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:29,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:29,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:29,035 INFO L87 Difference]: Start difference. First operand 667 states and 981 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:29,291 INFO L93 Difference]: Finished difference Result 1066 states and 1573 transitions. [2025-03-16 22:37:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-03-16 22:37:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:29,293 INFO L225 Difference]: With dead ends: 1066 [2025-03-16 22:37:29,293 INFO L226 Difference]: Without dead ends: 667 [2025-03-16 22:37:29,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:29,294 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1240 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:29,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1365 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-16 22:37:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-16 22:37:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4714714714714714) internal successors, (980), 666 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 980 transitions. [2025-03-16 22:37:29,304 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 980 transitions. Word has length 216 [2025-03-16 22:37:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:29,304 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 980 transitions. [2025-03-16 22:37:29,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 980 transitions. [2025-03-16 22:37:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 22:37:29,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:29,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:29,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:37:29,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash 662735032, now seen corresponding path program 1 times [2025-03-16 22:37:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:29,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372753495] [2025-03-16 22:37:29,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:29,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 22:37:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 22:37:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372753495] [2025-03-16 22:37:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372753495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898696753] [2025-03-16 22:37:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:29,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:29,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:29,973 INFO L87 Difference]: Start difference. First operand 667 states and 980 transitions. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:30,221 INFO L93 Difference]: Finished difference Result 1006 states and 1484 transitions. [2025-03-16 22:37:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-16 22:37:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:30,224 INFO L225 Difference]: With dead ends: 1006 [2025-03-16 22:37:30,224 INFO L226 Difference]: Without dead ends: 669 [2025-03-16 22:37:30,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:30,225 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1598 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:30,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 1364 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-16 22:37:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2025-03-16 22:37:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.4707646176911544) internal successors, (981), 667 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 981 transitions. [2025-03-16 22:37:30,235 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 981 transitions. Word has length 217 [2025-03-16 22:37:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:30,235 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 981 transitions. [2025-03-16 22:37:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 981 transitions. [2025-03-16 22:37:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 22:37:30,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:30,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:30,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:37:30,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash -813384005, now seen corresponding path program 1 times [2025-03-16 22:37:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390204907] [2025-03-16 22:37:30,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 22:37:30,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 22:37:30,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:30,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390204907] [2025-03-16 22:37:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390204907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774618790] [2025-03-16 22:37:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:30,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:30,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:30,991 INFO L87 Difference]: Start difference. First operand 668 states and 981 transitions. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:31,311 INFO L93 Difference]: Finished difference Result 1138 states and 1677 transitions. [2025-03-16 22:37:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-16 22:37:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:31,314 INFO L225 Difference]: With dead ends: 1138 [2025-03-16 22:37:31,314 INFO L226 Difference]: Without dead ends: 714 [2025-03-16 22:37:31,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:31,315 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1391 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:31,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 2111 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-16 22:37:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 670. [2025-03-16 22:37:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 1.4693572496263079) internal successors, (983), 669 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 983 transitions. [2025-03-16 22:37:31,324 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 983 transitions. Word has length 218 [2025-03-16 22:37:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:31,324 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 983 transitions. [2025-03-16 22:37:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 983 transitions. [2025-03-16 22:37:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 22:37:31,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:31,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:31,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:37:31,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2108475507, now seen corresponding path program 1 times [2025-03-16 22:37:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374847344] [2025-03-16 22:37:31,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:31,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 22:37:31,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 22:37:31,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374847344] [2025-03-16 22:37:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374847344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:37:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648214451] [2025-03-16 22:37:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:31,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:37:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:31,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:37:31,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:31,998 INFO L87 Difference]: Start difference. First operand 670 states and 983 transitions. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:32,274 INFO L93 Difference]: Finished difference Result 1072 states and 1578 transitions. [2025-03-16 22:37:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-16 22:37:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:32,276 INFO L225 Difference]: With dead ends: 1072 [2025-03-16 22:37:32,276 INFO L226 Difference]: Without dead ends: 676 [2025-03-16 22:37:32,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:32,277 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1255 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:32,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2139 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-16 22:37:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2025-03-16 22:37:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.4679582712369597) internal successors, (985), 671 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 985 transitions. [2025-03-16 22:37:32,284 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 985 transitions. Word has length 218 [2025-03-16 22:37:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:32,284 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 985 transitions. [2025-03-16 22:37:32,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 985 transitions. [2025-03-16 22:37:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 22:37:32,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:32,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:32,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:37:32,286 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:32,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1448479218, now seen corresponding path program 1 times [2025-03-16 22:37:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:32,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449583677] [2025-03-16 22:37:32,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:32,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 22:37:32,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 22:37:32,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:32,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:32,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449583677] [2025-03-16 22:37:32,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449583677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:32,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635805164] [2025-03-16 22:37:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:32,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:32,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:32,912 INFO L87 Difference]: Start difference. First operand 672 states and 985 transitions. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:33,178 INFO L93 Difference]: Finished difference Result 1040 states and 1531 transitions. [2025-03-16 22:37:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-16 22:37:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:33,180 INFO L225 Difference]: With dead ends: 1040 [2025-03-16 22:37:33,180 INFO L226 Difference]: Without dead ends: 672 [2025-03-16 22:37:33,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:33,181 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1340 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:33,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1822 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-16 22:37:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-16 22:37:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.466467958271237) internal successors, (984), 671 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 984 transitions. [2025-03-16 22:37:33,188 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 984 transitions. Word has length 219 [2025-03-16 22:37:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:33,188 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 984 transitions. [2025-03-16 22:37:33,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 984 transitions. [2025-03-16 22:37:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 22:37:33,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:33,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:33,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:37:33,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2125840541, now seen corresponding path program 1 times [2025-03-16 22:37:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:33,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337330510] [2025-03-16 22:37:33,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:33,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 22:37:33,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 22:37:33,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:33,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337330510] [2025-03-16 22:37:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337330510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:37:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274581933] [2025-03-16 22:37:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:37:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:33,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:37:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:33,914 INFO L87 Difference]: Start difference. First operand 672 states and 984 transitions. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 7 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:34,184 INFO L93 Difference]: Finished difference Result 1110 states and 1632 transitions. [2025-03-16 22:37:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 7 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-16 22:37:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:34,186 INFO L225 Difference]: With dead ends: 1110 [2025-03-16 22:37:34,186 INFO L226 Difference]: Without dead ends: 718 [2025-03-16 22:37:34,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:34,187 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1809 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 2185 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:34,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 2185 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-16 22:37:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 674. [2025-03-16 22:37:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.465081723625557) internal successors, (986), 673 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 986 transitions. [2025-03-16 22:37:34,193 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 986 transitions. Word has length 220 [2025-03-16 22:37:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:34,194 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 986 transitions. [2025-03-16 22:37:34,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 7 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 986 transitions. [2025-03-16 22:37:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 22:37:34,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:34,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:37:34,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2030744217, now seen corresponding path program 1 times [2025-03-16 22:37:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697353910] [2025-03-16 22:37:34,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:34,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 22:37:34,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 22:37:34,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:34,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697353910] [2025-03-16 22:37:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697353910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075863767] [2025-03-16 22:37:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:35,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:35,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:35,497 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-16 22:37:35,498 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-16 22:37:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 22:37:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 22:37:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:36,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:36,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 22:37:36,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:37,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:37,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075863767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:37,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 31 [2025-03-16 22:37:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633286785] [2025-03-16 22:37:37,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:37,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 22:37:37,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:37,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 22:37:37,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-03-16 22:37:37,894 INFO L87 Difference]: Start difference. First operand 674 states and 986 transitions. Second operand has 32 states, 32 states have (on average 20.25) internal successors, (648), 31 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:39,554 INFO L93 Difference]: Finished difference Result 2551 states and 3720 transitions. [2025-03-16 22:37:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 22:37:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 20.25) internal successors, (648), 31 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-16 22:37:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:39,559 INFO L225 Difference]: With dead ends: 2551 [2025-03-16 22:37:39,559 INFO L226 Difference]: Without dead ends: 1951 [2025-03-16 22:37:39,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 22:37:39,560 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 14381 mSDsluCounter, 11850 mSDsCounter, 0 mSdLazyCounter, 4516 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14381 SdHoareTripleChecker+Valid, 12599 SdHoareTripleChecker+Invalid, 4522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:39,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14381 Valid, 12599 Invalid, 4522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4516 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 22:37:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2025-03-16 22:37:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 995. [2025-03-16 22:37:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4567404426559356) internal successors, (1448), 994 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1448 transitions. [2025-03-16 22:37:39,572 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1448 transitions. Word has length 220 [2025-03-16 22:37:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:39,572 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1448 transitions. [2025-03-16 22:37:39,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 20.25) internal successors, (648), 31 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1448 transitions. [2025-03-16 22:37:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 22:37:39,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:39,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:39,585 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-16 22:37:39,774 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,SelfDestructingSolverStorable20 [2025-03-16 22:37:39,774 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2125774130, now seen corresponding path program 1 times [2025-03-16 22:37:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619517667] [2025-03-16 22:37:39,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:39,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 22:37:39,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 22:37:39,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:39,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619517667] [2025-03-16 22:37:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619517667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087602917] [2025-03-16 22:37:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:40,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:40,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:40,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:40,086 INFO L87 Difference]: Start difference. First operand 995 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:40,382 INFO L93 Difference]: Finished difference Result 1608 states and 2345 transitions. [2025-03-16 22:37:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-16 22:37:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:40,386 INFO L225 Difference]: With dead ends: 1608 [2025-03-16 22:37:40,386 INFO L226 Difference]: Without dead ends: 1003 [2025-03-16 22:37:40,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:37:40,388 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1375 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:40,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1817 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:37:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-16 22:37:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 989. [2025-03-16 22:37:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.4554655870445343) internal successors, (1438), 988 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1438 transitions. [2025-03-16 22:37:40,397 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1438 transitions. Word has length 221 [2025-03-16 22:37:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:40,397 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1438 transitions. [2025-03-16 22:37:40,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1438 transitions. [2025-03-16 22:37:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 22:37:40,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:40,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:37:40,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:37:40,399 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2084916877, now seen corresponding path program 1 times [2025-03-16 22:37:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955763217] [2025-03-16 22:37:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:40,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 22:37:40,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 22:37:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:40,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955763217] [2025-03-16 22:37:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955763217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:40,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643938097] [2025-03-16 22:37:40,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:40,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:40,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:40,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:40,675 INFO L87 Difference]: Start difference. First operand 989 states and 1438 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:40,839 INFO L93 Difference]: Finished difference Result 1326 states and 1939 transitions. [2025-03-16 22:37:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-16 22:37:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:40,841 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 22:37:40,841 INFO L226 Difference]: Without dead ends: 726 [2025-03-16 22:37:40,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:40,841 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1376 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:40,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1369 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:37:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-16 22:37:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2025-03-16 22:37:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.4620689655172414) internal successors, (1060), 725 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1060 transitions. [2025-03-16 22:37:40,847 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1060 transitions. Word has length 221 [2025-03-16 22:37:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:40,848 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1060 transitions. [2025-03-16 22:37:40,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1060 transitions. [2025-03-16 22:37:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 22:37:40,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:40,850 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 22:37:40,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:37:40,850 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:40,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1634701661, now seen corresponding path program 1 times [2025-03-16 22:37:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:40,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827545454] [2025-03-16 22:37:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:40,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 22:37:42,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 22:37:42,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:42,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827545454] [2025-03-16 22:37:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827545454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:43,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:43,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:37:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825755873] [2025-03-16 22:37:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:43,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:37:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:43,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:37:43,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:37:43,743 INFO L87 Difference]: Start difference. First operand 726 states and 1060 transitions. Second operand has 9 states, 9 states have (on average 43.0) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:44,344 INFO L93 Difference]: Finished difference Result 2003 states and 2963 transitions. [2025-03-16 22:37:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 22:37:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 43.0) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387 [2025-03-16 22:37:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:44,348 INFO L225 Difference]: With dead ends: 2003 [2025-03-16 22:37:44,348 INFO L226 Difference]: Without dead ends: 1666 [2025-03-16 22:37:44,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:37:44,349 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 2026 mSDsluCounter, 4237 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:44,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 5001 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:37:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-16 22:37:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1080. [2025-03-16 22:37:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 1.4698795180722892) internal successors, (1586), 1079 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1586 transitions. [2025-03-16 22:37:44,360 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1586 transitions. Word has length 387 [2025-03-16 22:37:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:44,360 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1586 transitions. [2025-03-16 22:37:44,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 43.0) internal successors, (387), 8 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1586 transitions. [2025-03-16 22:37:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-16 22:37:44,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:44,362 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:37:44,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 22:37:44,363 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash 329629668, now seen corresponding path program 1 times [2025-03-16 22:37:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315314931] [2025-03-16 22:37:44,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-16 22:37:47,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-16 22:37:47,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:47,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 162 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315314931] [2025-03-16 22:37:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315314931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:37:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726984667] [2025-03-16 22:37:49,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:49,149 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-16 22:37:49,150 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-16 22:37:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-16 22:37:50,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-16 22:37:50,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:50,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:50,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 22:37:50,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:50,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:37:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726984667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:51,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:37:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 27 [2025-03-16 22:37:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364938280] [2025-03-16 22:37:51,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:51,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 22:37:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:51,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 22:37:51,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-03-16 22:37:51,834 INFO L87 Difference]: Start difference. First operand 1080 states and 1586 transitions. Second operand has 28 states, 28 states have (on average 32.142857142857146) internal successors, (900), 27 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:54,915 INFO L93 Difference]: Finished difference Result 5103 states and 7589 transitions. [2025-03-16 22:37:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-16 22:37:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 32.142857142857146) internal successors, (900), 27 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 388 [2025-03-16 22:37:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:54,925 INFO L225 Difference]: With dead ends: 5103 [2025-03-16 22:37:54,925 INFO L226 Difference]: Without dead ends: 4435 [2025-03-16 22:37:54,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1264, Invalid=7108, Unknown=0, NotChecked=0, Total=8372 [2025-03-16 22:37:54,928 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 16967 mSDsluCounter, 13915 mSDsCounter, 0 mSdLazyCounter, 5157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16967 SdHoareTripleChecker+Valid, 14662 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:54,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16967 Valid, 14662 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5157 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 22:37:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2025-03-16 22:37:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 1720. [2025-03-16 22:37:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.4729493891797556) internal successors, (2532), 1719 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2532 transitions. [2025-03-16 22:37:54,947 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2532 transitions. Word has length 388 [2025-03-16 22:37:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:54,947 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2532 transitions. [2025-03-16 22:37:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 32.142857142857146) internal successors, (900), 27 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2532 transitions. [2025-03-16 22:37:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-16 22:37:54,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:54,949 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:37:54,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:37:55,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:55,150 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash -847118353, now seen corresponding path program 1 times [2025-03-16 22:37:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773845517] [2025-03-16 22:37:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-16 22:37:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-16 22:37:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 146 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:38:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773845517] [2025-03-16 22:38:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773845517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:38:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094377482] [2025-03-16 22:38:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:00,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:38:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:38:00,374 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-16 22:38:00,375 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-16 22:38:00,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-16 22:38:01,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-16 22:38:01,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:01,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-16 22:38:01,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:38:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 125 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:01,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:38:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 125 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094377482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:38:02,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:38:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 26 [2025-03-16 22:38:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213221666] [2025-03-16 22:38:02,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:38:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 22:38:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:38:02,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 22:38:02,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-03-16 22:38:02,133 INFO L87 Difference]: Start difference. First operand 1720 states and 2532 transitions. Second operand has 27 states, 27 states have (on average 34.25925925925926) internal successors, (925), 26 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:38:04,723 INFO L93 Difference]: Finished difference Result 7615 states and 11317 transitions. [2025-03-16 22:38:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 22:38:04,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 34.25925925925926) internal successors, (925), 26 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2025-03-16 22:38:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:38:04,743 INFO L225 Difference]: With dead ends: 7615 [2025-03-16 22:38:04,743 INFO L226 Difference]: Without dead ends: 6307 [2025-03-16 22:38:04,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1356, Invalid=6300, Unknown=0, NotChecked=0, Total=7656 [2025-03-16 22:38:04,748 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 14671 mSDsluCounter, 10869 mSDsCounter, 0 mSdLazyCounter, 3993 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14671 SdHoareTripleChecker+Valid, 11655 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:38:04,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14671 Valid, 11655 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3993 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 22:38:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2025-03-16 22:38:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 2133. [2025-03-16 22:38:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2132 states have (on average 1.4713883677298312) internal successors, (3137), 2132 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3137 transitions. [2025-03-16 22:38:04,782 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3137 transitions. Word has length 390 [2025-03-16 22:38:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:38:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 3137 transitions. [2025-03-16 22:38:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 34.25925925925926) internal successors, (925), 26 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3137 transitions. [2025-03-16 22:38:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-16 22:38:04,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:38:04,786 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:38:04,803 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-16 22:38:04,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 22:38:04,987 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:38:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:38:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 566980519, now seen corresponding path program 1 times [2025-03-16 22:38:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:38:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815593588] [2025-03-16 22:38:04,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:38:05,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 22:38:07,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 22:38:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 130 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:38:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815593588] [2025-03-16 22:38:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815593588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:38:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330650225] [2025-03-16 22:38:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:38:09,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:38:09,850 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-16 22:38:09,852 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-16 22:38:10,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 22:38:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 22:38:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:10,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-16 22:38:10,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:38:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 130 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:11,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:38:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 22:38:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330650225] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:38:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:38:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 10] total 26 [2025-03-16 22:38:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331226537] [2025-03-16 22:38:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:38:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:38:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:38:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:38:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:38:11,602 INFO L87 Difference]: Start difference. First operand 2133 states and 3137 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:38:11,894 INFO L93 Difference]: Finished difference Result 4446 states and 6566 transitions. [2025-03-16 22:38:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:38:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-16 22:38:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:38:11,898 INFO L225 Difference]: With dead ends: 4446 [2025-03-16 22:38:11,898 INFO L226 Difference]: Without dead ends: 2725 [2025-03-16 22:38:11,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-03-16 22:38:11,900 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 553 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:38:11,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 2408 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:38:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2025-03-16 22:38:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2344. [2025-03-16 22:38:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2343 states have (on average 1.4716175842936405) internal successors, (3448), 2343 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3448 transitions. [2025-03-16 22:38:11,919 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3448 transitions. Word has length 392 [2025-03-16 22:38:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:38:11,919 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3448 transitions. [2025-03-16 22:38:11,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3448 transitions. [2025-03-16 22:38:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-16 22:38:11,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:38:11,922 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 22:38:11,934 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-16 22:38:12,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 22:38:12,122 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:38:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:38:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1069204644, now seen corresponding path program 1 times [2025-03-16 22:38:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:38:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957129092] [2025-03-16 22:38:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:38:12,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 22:38:13,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 22:38:13,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 146 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:38:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957129092] [2025-03-16 22:38:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957129092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:38:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335938162] [2025-03-16 22:38:14,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:38:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:38:14,882 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-16 22:38:14,883 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-16 22:38:15,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-16 22:38:15,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-16 22:38:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:15,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 22:38:15,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:38:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 45 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:16,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:38:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 45 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335938162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:38:18,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:38:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2025-03-16 22:38:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951946022] [2025-03-16 22:38:18,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:38:18,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 22:38:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:38:18,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 22:38:18,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-03-16 22:38:18,046 INFO L87 Difference]: Start difference. First operand 2344 states and 3448 transitions. Second operand has 30 states, 30 states have (on average 36.8) internal successors, (1104), 29 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:38:20,283 INFO L93 Difference]: Finished difference Result 5027 states and 7427 transitions. [2025-03-16 22:38:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-16 22:38:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 36.8) internal successors, (1104), 29 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-16 22:38:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:38:20,288 INFO L225 Difference]: With dead ends: 5027 [2025-03-16 22:38:20,288 INFO L226 Difference]: Without dead ends: 3095 [2025-03-16 22:38:20,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=891, Invalid=3665, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 22:38:20,292 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 12710 mSDsluCounter, 10655 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12710 SdHoareTripleChecker+Valid, 11401 SdHoareTripleChecker+Invalid, 4246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:38:20,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12710 Valid, 11401 Invalid, 4246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 22:38:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-03-16 22:38:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3020. [2025-03-16 22:38:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 1.4736667770785028) internal successors, (4449), 3019 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4449 transitions. [2025-03-16 22:38:20,319 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4449 transitions. Word has length 392 [2025-03-16 22:38:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:38:20,319 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 4449 transitions. [2025-03-16 22:38:20,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 36.8) internal successors, (1104), 29 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4449 transitions. [2025-03-16 22:38:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-16 22:38:20,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:38:20,321 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:38:20,336 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-16 22:38:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 22:38:20,522 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:38:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:38:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1352816197, now seen corresponding path program 1 times [2025-03-16 22:38:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:38:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958265668] [2025-03-16 22:38:20,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:38:20,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-16 22:38:22,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-16 22:38:22,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 159 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:38:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958265668] [2025-03-16 22:38:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958265668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:38:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303777634] [2025-03-16 22:38:23,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:38:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:38:23,252 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-16 22:38:23,253 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-16 22:38:23,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-16 22:38:24,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-16 22:38:24,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:38:24,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:38:24,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 2487 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-16 22:38:24,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:38:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 63 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:24,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:38:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 63 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:38:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303777634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:38:26,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:38:26,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 25 [2025-03-16 22:38:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465688255] [2025-03-16 22:38:26,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:38:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 22:38:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:38:26,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 22:38:26,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:38:26,616 INFO L87 Difference]: Start difference. First operand 3020 states and 4449 transitions. Second operand has 26 states, 26 states have (on average 41.30769230769231) internal successors, (1074), 25 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:38:27,817 INFO L93 Difference]: Finished difference Result 5296 states and 7805 transitions. [2025-03-16 22:38:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 22:38:27,818 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 41.30769230769231) internal successors, (1074), 25 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-03-16 22:38:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:38:27,822 INFO L225 Difference]: With dead ends: 5296 [2025-03-16 22:38:27,822 INFO L226 Difference]: Without dead ends: 2688 [2025-03-16 22:38:27,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=1295, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 22:38:27,824 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 7760 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7760 SdHoareTripleChecker+Valid, 6958 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:38:27,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7760 Valid, 6958 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 22:38:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-03-16 22:38:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2538. [2025-03-16 22:38:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2537 states have (on average 1.4635396137169885) internal successors, (3713), 2537 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3713 transitions. [2025-03-16 22:38:27,842 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3713 transitions. Word has length 394 [2025-03-16 22:38:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:38:27,842 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3713 transitions. [2025-03-16 22:38:27,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 41.30769230769231) internal successors, (1074), 25 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:38:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3713 transitions. [2025-03-16 22:38:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-03-16 22:38:27,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:38:27,845 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 22:38:27,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 22:38:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:38:28,045 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:38:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:38:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 317634143, now seen corresponding path program 1 times [2025-03-16 22:38:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:38:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554854248] [2025-03-16 22:38:28,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:38:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:38:28,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes.