./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.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.vis_arrays_vsaR_p11.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 ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:50:52,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:50:52,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:50:52,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:50:52,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:50:52,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:50:52,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:50:52,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:50:52,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:50:52,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:50:52,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:50:52,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:50:52,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:50:52,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:50:52,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:50:52,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:50:52,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:50:52,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:52,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:50:52,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:50:52,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:50:52,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:50:52,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:50:52,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:50:52,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:50:52,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:50:52,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:50:52,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:50:52,731 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 -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2025-03-16 22:50:52,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:50:52,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:50:52,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:50:52,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:50:52,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:50:52,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:50:54,110 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18173f6e/fd50b6f4f9e046869d9d2257b963229d/FLAG9899827c2 [2025-03-16 22:50:54,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:50:54,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:50:54,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18173f6e/fd50b6f4f9e046869d9d2257b963229d/FLAG9899827c2 [2025-03-16 22:50:54,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18173f6e/fd50b6f4f9e046869d9d2257b963229d [2025-03-16 22:50:54,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:50:54,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:50:54,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:54,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:50:54,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:50:54,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:54" (1/1) ... [2025-03-16 22:50:54,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de64143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:54, skipping insertion in model container [2025-03-16 22:50:54,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:54" (1/1) ... [2025-03-16 22:50:54,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:50:54,838 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.vis_arrays_vsaR_p11.c[1259,1272] [2025-03-16 22:50:54,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:55,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:50:55,014 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.vis_arrays_vsaR_p11.c[1259,1272] [2025-03-16 22:50:55,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:55,114 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:50:55,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55 WrapperNode [2025-03-16 22:50:55,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:55,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:55,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:50:55,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:50:55,121 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:50:55" (1/1) ... [2025-03-16 22:50:55,144 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:50:55" (1/1) ... [2025-03-16 22:50:55,344 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2172 [2025-03-16 22:50:55,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:55,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:50:55,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:50:55,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:50:55,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,472 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:50:55,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:50:55,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:50:55,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:50:55,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:50:55,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (1/1) ... [2025-03-16 22:50:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:55,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:55,623 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:50:55,627 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:50:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:50:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:50:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:50:55,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:50:55,839 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:50:55,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:50:57,471 INFO L? ?]: Removed 1357 outVars from TransFormulas that were not future-live. [2025-03-16 22:50:57,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:50:57,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:50:57,566 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:50:57,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:57 BoogieIcfgContainer [2025-03-16 22:50:57,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:50:57,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:50:57,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:50:57,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:50:57,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:50:54" (1/3) ... [2025-03-16 22:50:57,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac0607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:57, skipping insertion in model container [2025-03-16 22:50:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:55" (2/3) ... [2025-03-16 22:50:57,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ac0607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:57, skipping insertion in model container [2025-03-16 22:50:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:57" (3/3) ... [2025-03-16 22:50:57,577 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:50:57,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:50:57,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c that has 1 procedures, 549 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:50:57,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:50:57,652 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;@2dfd4ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:50:57,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:50:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 549 states, 547 states have (on average 1.5009140767824498) internal successors, (821), 548 states have internal predecessors, (821), 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:50:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 22:50:57,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:57,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:57,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1825445946, now seen corresponding path program 1 times [2025-03-16 22:50:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:57,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880738669] [2025-03-16 22:50:57,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 22:50:57,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 22:50:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:58,296 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:50:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:58,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880738669] [2025-03-16 22:50:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880738669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018499508] [2025-03-16 22:50:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:58,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:58,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:58,318 INFO L87 Difference]: Start difference. First operand has 549 states, 547 states have (on average 1.5009140767824498) internal successors, (821), 548 states have internal predecessors, (821), 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 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:50:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:58,644 INFO L93 Difference]: Finished difference Result 1045 states and 1565 transitions. [2025-03-16 22:50:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-03-16 22:50:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:58,658 INFO L225 Difference]: With dead ends: 1045 [2025-03-16 22:50:58,658 INFO L226 Difference]: Without dead ends: 549 [2025-03-16 22:50:58,662 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:50:58,664 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:58,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2038 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:58,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-16 22:50:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-03-16 22:50:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4963503649635037) internal successors, (820), 548 states have internal predecessors, (820), 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:50:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 820 transitions. [2025-03-16 22:50:58,706 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 820 transitions. Word has length 52 [2025-03-16 22:50:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:58,706 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 820 transitions. [2025-03-16 22:50:58,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:50:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 820 transitions. [2025-03-16 22:50:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:50:58,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:58,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:58,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:50:58,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:58,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -749569556, now seen corresponding path program 1 times [2025-03-16 22:50:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356857460] [2025-03-16 22:50:58,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:58,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:50:58,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:50:58,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:58,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:58,877 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:50:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356857460] [2025-03-16 22:50:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356857460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402529859] [2025-03-16 22:50:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:58,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:58,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:58,881 INFO L87 Difference]: Start difference. First operand 549 states and 820 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:50:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:59,135 INFO L93 Difference]: Finished difference Result 1047 states and 1564 transitions. [2025-03-16 22:50:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:59,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2025-03-16 22:50:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:59,141 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 22:50:59,141 INFO L226 Difference]: Without dead ends: 551 [2025-03-16 22:50:59,143 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:50:59,144 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:59,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2035 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:50:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-16 22:50:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-16 22:50:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4945454545454546) internal successors, (822), 550 states have internal predecessors, (822), 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:50:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 822 transitions. [2025-03-16 22:50:59,172 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 822 transitions. Word has length 53 [2025-03-16 22:50:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:59,172 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 822 transitions. [2025-03-16 22:50:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:50:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 822 transitions. [2025-03-16 22:50:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:50:59,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:59,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:50:59,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:59,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 169690241, now seen corresponding path program 1 times [2025-03-16 22:50:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:59,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393260165] [2025-03-16 22:50:59,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:59,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:50:59,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:50:59,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:59,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:59,593 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:50:59,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393260165] [2025-03-16 22:50:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393260165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:59,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:50:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706687631] [2025-03-16 22:50:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:59,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:50:59,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:59,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:50:59,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:59,594 INFO L87 Difference]: Start difference. First operand 551 states and 822 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:50:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:59,976 INFO L93 Difference]: Finished difference Result 1062 states and 1584 transitions. [2025-03-16 22:50:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:50:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 54 [2025-03-16 22:50:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:59,978 INFO L225 Difference]: With dead ends: 1062 [2025-03-16 22:50:59,979 INFO L226 Difference]: Without dead ends: 564 [2025-03-16 22:50:59,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:59,980 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 10 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:59,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3368 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-16 22:50:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 559. [2025-03-16 22:50:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.492831541218638) internal successors, (833), 558 states have internal predecessors, (833), 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:50:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 833 transitions. [2025-03-16 22:50:59,992 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 833 transitions. Word has length 54 [2025-03-16 22:50:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:59,994 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 833 transitions. [2025-03-16 22:50:59,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:50:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 833 transitions. [2025-03-16 22:50:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:50:59,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:59,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:50:59,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1441173839, now seen corresponding path program 1 times [2025-03-16 22:50:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600038615] [2025-03-16 22:50:59,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:00,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:51:00,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:51:00,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:00,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:00,258 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:51:00,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600038615] [2025-03-16 22:51:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600038615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:00,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:51:00,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614925858] [2025-03-16 22:51:00,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:51:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:00,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:51:00,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:51:00,259 INFO L87 Difference]: Start difference. First operand 559 states and 833 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:51:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:00,673 INFO L93 Difference]: Finished difference Result 1073 states and 1599 transitions. [2025-03-16 22:51:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:51:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 55 [2025-03-16 22:51:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:00,675 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 22:51:00,676 INFO L226 Difference]: Without dead ends: 567 [2025-03-16 22:51:00,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:51:00,678 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 9 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:00,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4043 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:51:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-16 22:51:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2025-03-16 22:51:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.4920353982300885) internal successors, (843), 565 states have internal predecessors, (843), 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:51:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 843 transitions. [2025-03-16 22:51:00,689 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 843 transitions. Word has length 55 [2025-03-16 22:51:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:00,689 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 843 transitions. [2025-03-16 22:51:00,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:51:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 843 transitions. [2025-03-16 22:51:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:51:00,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:00,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:00,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:51:00,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1022350752, now seen corresponding path program 1 times [2025-03-16 22:51:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:00,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235405296] [2025-03-16 22:51:00,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:51:00,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:51:00,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:00,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:00,826 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:51:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235405296] [2025-03-16 22:51:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235405296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:51:00,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805862391] [2025-03-16 22:51:00,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:51:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:00,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:51:00,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:51:00,829 INFO L87 Difference]: Start difference. First operand 566 states and 843 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:51:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:01,105 INFO L93 Difference]: Finished difference Result 1089 states and 1622 transitions. [2025-03-16 22:51:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:51:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-03-16 22:51:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:01,107 INFO L225 Difference]: With dead ends: 1089 [2025-03-16 22:51:01,107 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 22:51:01,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:51:01,108 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 8 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2710 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:51:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 22:51:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2025-03-16 22:51:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.4904347826086957) internal successors, (857), 575 states have internal predecessors, (857), 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:51:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 857 transitions. [2025-03-16 22:51:01,119 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 857 transitions. Word has length 55 [2025-03-16 22:51:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:01,119 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 857 transitions. [2025-03-16 22:51:01,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:51:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 857 transitions. [2025-03-16 22:51:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 22:51:01,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:01,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:51:01,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:01,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -261504784, now seen corresponding path program 1 times [2025-03-16 22:51:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533096833] [2025-03-16 22:51:01,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:01,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 22:51:01,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 22:51:01,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:01,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:01,568 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:51:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533096833] [2025-03-16 22:51:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533096833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:51:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671287828] [2025-03-16 22:51:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:01,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:51:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:01,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:51:01,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:51:01,570 INFO L87 Difference]: Start difference. First operand 576 states and 857 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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:51:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:02,250 INFO L93 Difference]: Finished difference Result 1106 states and 1644 transitions. [2025-03-16 22:51:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:51:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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 56 [2025-03-16 22:51:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:02,252 INFO L225 Difference]: With dead ends: 1106 [2025-03-16 22:51:02,253 INFO L226 Difference]: Without dead ends: 583 [2025-03-16 22:51:02,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:51:02,254 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 810 mSDsluCounter, 4013 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:02,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 4684 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:51:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-16 22:51:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 580. [2025-03-16 22:51:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4887737478411054) internal successors, (862), 579 states have internal predecessors, (862), 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:51:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 862 transitions. [2025-03-16 22:51:02,264 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 862 transitions. Word has length 56 [2025-03-16 22:51:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:02,264 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 862 transitions. [2025-03-16 22:51:02,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 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:51:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 862 transitions. [2025-03-16 22:51:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 22:51:02,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:02,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:51:02,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -940366190, now seen corresponding path program 1 times [2025-03-16 22:51:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250333137] [2025-03-16 22:51:02,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:02,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 22:51:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 22:51:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:02,486 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:51:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250333137] [2025-03-16 22:51:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250333137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:51:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555762949] [2025-03-16 22:51:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:51:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:02,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:51:02,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:51:02,488 INFO L87 Difference]: Start difference. First operand 580 states and 862 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:51:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:02,890 INFO L93 Difference]: Finished difference Result 1309 states and 1940 transitions. [2025-03-16 22:51:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:51:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2025-03-16 22:51:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:02,893 INFO L225 Difference]: With dead ends: 1309 [2025-03-16 22:51:02,893 INFO L226 Difference]: Without dead ends: 782 [2025-03-16 22:51:02,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:51:02,894 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1358 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:02,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 2667 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:51:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-03-16 22:51:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 586. [2025-03-16 22:51:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4871794871794872) internal successors, (870), 585 states have internal predecessors, (870), 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:51:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 870 transitions. [2025-03-16 22:51:02,904 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 870 transitions. Word has length 56 [2025-03-16 22:51:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 870 transitions. [2025-03-16 22:51:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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:51:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 870 transitions. [2025-03-16 22:51:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 22:51:02,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:02,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:51:02,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:02,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1075495410, now seen corresponding path program 1 times [2025-03-16 22:51:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:02,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116724759] [2025-03-16 22:51:02,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:02,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 22:51:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 22:51:02,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:51:02,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:51:02,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 22:51:03,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 22:51:03,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:03,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:51:03,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:51:03,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:51:03,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:51:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:51:03,054 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:03,091 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:51:03,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:51:03,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:51:03 BoogieIcfgContainer [2025-03-16 22:51:03,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:51:03,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:51:03,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:51:03,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:51:03,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:57" (3/4) ... [2025-03-16 22:51:03,115 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:51:03,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:51:03,116 INFO L158 Benchmark]: Toolchain (without parser) took 8430.32ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 121.4MB in the beginning and 309.7MB in the end (delta: -188.3MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,116 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:51:03,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.04ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 76.5MB in the end (delta: 44.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 227.78ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 76.5MB in the beginning and 99.4MB in the end (delta: -22.9MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,117 INFO L158 Benchmark]: Boogie Preprocessor took 251.44ms. Allocated memory is still 176.2MB. Free memory was 99.4MB in the beginning and 84.3MB in the end (delta: 15.0MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,117 INFO L158 Benchmark]: IcfgBuilder took 1971.98ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 84.3MB in the beginning and 101.1MB in the end (delta: -16.8MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,117 INFO L158 Benchmark]: TraceAbstraction took 5541.13ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 100.2MB in the beginning and 314.0MB in the end (delta: -213.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:51:03,118 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 427.8MB. Free memory was 314.0MB in the beginning and 309.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:51:03,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.04ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 76.5MB in the end (delta: 44.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 227.78ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 76.5MB in the beginning and 99.4MB in the end (delta: -22.9MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 251.44ms. Allocated memory is still 176.2MB. Free memory was 99.4MB in the beginning and 84.3MB in the end (delta: 15.0MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1971.98ms. Allocated memory was 176.2MB in the beginning and 352.3MB in the end (delta: 176.2MB). Free memory was 84.3MB in the beginning and 101.1MB in the end (delta: -16.8MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5541.13ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 100.2MB in the beginning and 314.0MB in the end (delta: -213.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 427.8MB. Free memory was 314.0MB in the beginning and 309.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 194. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 2); [L39] const SORT_18 msb_SORT_18 = (SORT_18)1 << (2 - 1); [L41] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 4); [L42] const SORT_84 msb_SORT_84 = (SORT_84)1 << (4 - 1); [L44] const SORT_148 mask_SORT_148 = (SORT_148)-1 >> (sizeof(SORT_148) * 8 - 32); [L45] const SORT_148 msb_SORT_148 = (SORT_148)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 1; [L50] const SORT_10 var_24 = 0; [L51] const SORT_1 var_28 = 0; [L52] const SORT_3 var_30 = 0; [L53] const SORT_1 var_38 = 1; [L54] const SORT_10 var_62 = 2; [L55] const SORT_10 var_70 = 4; [L56] const SORT_10 var_72 = 5; [L57] const SORT_10 var_100 = 7; [L58] const SORT_10 var_105 = 6; [L59] const SORT_148 var_150 = 0; [L60] const SORT_3 var_165 = 2; [L61] const SORT_3 var_187 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_176; [L67] SORT_3 input_177; [L68] SORT_3 input_178; [L69] SORT_3 input_186; [L70] SORT_3 input_195; [L71] SORT_3 input_196; [L72] SORT_3 input_197; [L73] SORT_3 input_200; [L74] SORT_3 input_219; [L75] SORT_3 input_220; [L76] SORT_3 input_221; [L77] SORT_3 input_224; [L78] SORT_3 input_226; [L79] SORT_18 input_240; [L80] SORT_18 input_241; [L81] SORT_18 input_242; [L83] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L83] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L84] SORT_10 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L85] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L86] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L87] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L88] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L89] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L90] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L91] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L92] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L93] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L94] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L95] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_5 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_10 init_26_arg_1 = var_24; [L100] state_25 = init_26_arg_1 [L101] SORT_3 init_32_arg_1 = var_30; [L102] state_31 = init_32_arg_1 [L103] SORT_3 init_43_arg_1 = var_30; [L104] state_42 = init_43_arg_1 [L105] SORT_3 init_45_arg_1 = var_30; [L106] state_44 = init_45_arg_1 [L107] SORT_1 init_47_arg_1 = var_28; [L108] state_46 = init_47_arg_1 [L109] SORT_3 init_49_arg_1 = var_30; [L110] state_48 = init_49_arg_1 [L111] SORT_3 init_51_arg_1 = var_30; [L112] state_50 = init_51_arg_1 [L113] SORT_3 init_53_arg_1 = var_30; [L114] state_52 = init_53_arg_1 [L115] SORT_3 init_55_arg_1 = var_30; [L116] state_54 = init_55_arg_1 [L117] SORT_3 init_57_arg_1 = var_30; [L118] state_56 = init_57_arg_1 [L119] SORT_3 init_59_arg_1 = var_30; [L120] state_58 = init_59_arg_1 [L121] SORT_3 init_61_arg_1 = var_30; [L122] state_60 = init_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_176 = __VERIFIER_nondet_uchar() [L129] input_177 = __VERIFIER_nondet_uchar() [L130] input_178 = __VERIFIER_nondet_uchar() [L131] input_186 = __VERIFIER_nondet_uchar() [L132] input_195 = __VERIFIER_nondet_uchar() [L133] input_196 = __VERIFIER_nondet_uchar() [L134] input_197 = __VERIFIER_nondet_uchar() [L135] input_200 = __VERIFIER_nondet_uchar() [L136] input_219 = __VERIFIER_nondet_uchar() [L137] input_220 = __VERIFIER_nondet_uchar() [L138] input_221 = __VERIFIER_nondet_uchar() [L139] input_224 = __VERIFIER_nondet_uchar() [L140] input_226 = __VERIFIER_nondet_uchar() [L141] input_240 = __VERIFIER_nondet_uchar() [L142] input_241 = __VERIFIER_nondet_uchar() [L143] input_242 = __VERIFIER_nondet_uchar() [L146] SORT_5 var_11_arg_0 = state_8; [L147] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] var_11 = var_11 & mask_SORT_10 [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_5 var_14_arg_0 = state_8; [L153] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] var_14 = var_14 & mask_SORT_10 [L155] SORT_10 var_16_arg_0 = var_14; [L156] SORT_10 var_16_arg_1 = var_15; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_13; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17_arg_0=0, var_17_arg_1=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_5 var_19_arg_0 = state_8; [L162] SORT_18 var_19 = var_19_arg_0 >> 7; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] EXPR var_19 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] var_19 = var_19 & mask_SORT_18 [L164] SORT_5 var_20_arg_0 = state_8; [L165] SORT_18 var_20 = var_20_arg_0 >> 5; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] EXPR var_20 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] var_20 = var_20 & mask_SORT_18 [L167] SORT_18 var_21_arg_0 = var_19; [L168] SORT_18 var_21_arg_1 = var_20; [L169] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L170] SORT_1 var_22_arg_0 = var_17; [L171] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_22_arg_0=0, var_22_arg_1=1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L173] SORT_1 var_23_arg_0 = var_22; [L174] SORT_1 var_23 = ~var_23_arg_0; [L175] SORT_10 var_27_arg_0 = state_25; [L176] SORT_1 var_27 = var_27_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_27=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] var_27 = var_27 & mask_SORT_1 [L178] SORT_1 var_29_arg_0 = var_27; [L179] SORT_1 var_29_arg_1 = var_28; [L180] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L181] SORT_3 var_33_arg_0 = state_31; [L182] SORT_3 var_33_arg_1 = var_30; [L183] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L184] SORT_1 var_34_arg_0 = var_29; [L185] SORT_1 var_34_arg_1 = var_33; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_34_arg_0=1, var_34_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L186] EXPR var_34_arg_0 | var_34_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L186] SORT_1 var_34 = var_34_arg_0 | var_34_arg_1; [L187] SORT_1 var_35_arg_0 = var_23; [L188] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_35_arg_0=-1, var_35_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L189] EXPR var_35_arg_0 | var_35_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L189] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L190] SORT_1 var_39_arg_0 = var_35; [L191] SORT_1 var_39 = ~var_39_arg_0; [L192] SORT_1 var_40_arg_0 = var_38; [L193] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_40_arg_0=1, var_40_arg_1=-1, var_62=2, var_70=4, var_72=5] [L194] EXPR var_40_arg_0 & var_40_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L194] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L195] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L195] var_40 = var_40 & mask_SORT_1 [L196] SORT_1 bad_41_arg_0 = var_40; [L197] CALL __VERIFIER_assert(!(bad_41_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 549 locations, 821 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2195 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2195 mSDsluCounter, 21545 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16813 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4636 IncrementalHoareTripleChecker+Invalid, 4638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4732 mSDtfsCounter, 4636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 205 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:51:03,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.vis_arrays_vsaR_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:51:05,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:51:05,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:51:05,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:51:05,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:51:05,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:51:05,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:51:05,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:51:05,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:51:05,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:51:05,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:51:05,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:51:05,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:51:05,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:51:05,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:51:05,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:51:05,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:51:05,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:51:05,125 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 -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2025-03-16 22:51:05,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:51:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:51:05,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:51:05,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:51:05,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:51:05,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:51:06,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/843c5b32a/703e701385e94d31b1c777f6b25ee515/FLAGa9ec7cd99 [2025-03-16 22:51:06,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:51:06,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:51:06,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/843c5b32a/703e701385e94d31b1c777f6b25ee515/FLAGa9ec7cd99 [2025-03-16 22:51:06,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/843c5b32a/703e701385e94d31b1c777f6b25ee515 [2025-03-16 22:51:06,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:51:06,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:51:06,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:51:06,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:51:06,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:51:06,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:51:06" (1/1) ... [2025-03-16 22:51:06,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3365ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:06, skipping insertion in model container [2025-03-16 22:51:06,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:51:06" (1/1) ... [2025-03-16 22:51:06,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:51:07,060 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.vis_arrays_vsaR_p11.c[1259,1272] [2025-03-16 22:51:07,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:51:07,240 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:51:07,247 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.vis_arrays_vsaR_p11.c[1259,1272] [2025-03-16 22:51:07,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:51:07,328 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:51:07,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07 WrapperNode [2025-03-16 22:51:07,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:51:07,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:51:07,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:51:07,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:51:07,336 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:51:07" (1/1) ... [2025-03-16 22:51:07,355 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:51:07" (1/1) ... [2025-03-16 22:51:07,413 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1090 [2025-03-16 22:51:07,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:51:07,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:51:07,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:51:07,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:51:07,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,462 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:51:07,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:51:07,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:51:07,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:51:07,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:51:07,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (1/1) ... [2025-03-16 22:51:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:51:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:07,569 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:51:07,571 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:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:51:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:51:07,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:51:07,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:51:08,707 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-03-16 22:51:08,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:51:08,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:51:08,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:51:08,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:51:08 BoogieIcfgContainer [2025-03-16 22:51:08,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:51:08,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:51:08,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:51:08,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:51:08,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:51:06" (1/3) ... [2025-03-16 22:51:08,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111642b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:51:08, skipping insertion in model container [2025-03-16 22:51:08,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:51:07" (2/3) ... [2025-03-16 22:51:08,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111642b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:51:08, skipping insertion in model container [2025-03-16 22:51:08,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:51:08" (3/3) ... [2025-03-16 22:51:08,721 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2025-03-16 22:51:08,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:51:08,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:51:08,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:51:08,777 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;@5b701aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:51:08,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:51:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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:51:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:51:08,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:08,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:51:08,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:51:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:51:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250582797] [2025-03-16 22:51:08,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:08,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:08,804 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:51:08,806 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:51:09,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:51:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:51:09,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:09,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:09,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 22:51:09,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:51:09,186 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:51:09,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:51:09,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:51:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250582797] [2025-03-16 22:51:09,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250582797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:09,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:09,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:51:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809213590] [2025-03-16 22:51:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:51:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:51:09,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:51:09,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:51:09,207 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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:51:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:09,279 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:51:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:51:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 22:51:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:09,285 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:51:09,285 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:51:09,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:51:09,289 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:09,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:51:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:51:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:51:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:51:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:51:09,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:51:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:09,308 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:51:09,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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:51:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:51:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:51:09,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:09,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:51:09,319 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:51:09,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:09,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:51:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:51:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778688515] [2025-03-16 22:51:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:09,516 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:51:09,517 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:51:09,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:51:09,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:51:09,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:09,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:09,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 22:51:09,825 INFO L279 TraceCheckSpWp]: Computing forward predicates...