./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.vcegar_QF_BV_itc99_b13_p12.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 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:27:11,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:27:11,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:27:11,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:27:11,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:27:11,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:27:11,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:27:11,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:27:11,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:27:11,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:27:11,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:27:11,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:27:11,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:27:11,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:27:11,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:27:11,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:27:11,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:27:11,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:11,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:27:11,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:27:11,338 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 -> 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 [2025-03-03 18:27:11,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:27:11,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:27:11,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:27:11,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:27:11,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:27:11,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:12,649 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67b6d894/81dec7e5961c4f6991e16d57682c9050/FLAGbadc65da3 [2025-03-03 18:27:12,870 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:27:12,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:12,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67b6d894/81dec7e5961c4f6991e16d57682c9050/FLAGbadc65da3 [2025-03-03 18:27:13,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67b6d894/81dec7e5961c4f6991e16d57682c9050 [2025-03-03 18:27:13,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:27:13,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:27:13,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:13,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:27:13,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:27:13,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64812bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13, skipping insertion in model container [2025-03-03 18:27:13,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:27:13,330 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.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-03 18:27:13,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:13,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:27:13,423 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.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-03 18:27:13,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:13,494 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:27:13,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13 WrapperNode [2025-03-03 18:27:13,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:13,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:13,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:27:13,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:27:13,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,562 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 746 [2025-03-03 18:27:13,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:13,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:27:13,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:27:13,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:27:13,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,611 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-03 18:27:13,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:27:13,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:27:13,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:27:13,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:27:13,655 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (1/1) ... [2025-03-03 18:27:13,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:13,679 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-03 18:27:13,681 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-03 18:27:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:27:13,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:27:13,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:27:13,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:27:13,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:27:13,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:27:14,487 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 18:27:14,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:27:14,519 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:27:14,521 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:27:14,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:14 BoogieIcfgContainer [2025-03-03 18:27:14,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:27:14,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:27:14,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:27:14,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:27:14,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:27:13" (1/3) ... [2025-03-03 18:27:14,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a828d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:14, skipping insertion in model container [2025-03-03 18:27:14,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:13" (2/3) ... [2025-03-03 18:27:14,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a828d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:14, skipping insertion in model container [2025-03-03 18:27:14,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:14" (3/3) ... [2025-03-03 18:27:14,528 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:14,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:27:14,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:27:14,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:27:14,632 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;@a8540ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:27:14,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:27:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 18:27:14,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:14,641 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] [2025-03-03 18:27:14,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:14,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1016460869, now seen corresponding path program 1 times [2025-03-03 18:27:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237576115] [2025-03-03 18:27:14,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:14,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 18:27:14,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 18:27:14,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:14,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:15,174 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-03 18:27:15,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:15,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237576115] [2025-03-03 18:27:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237576115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:15,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555704468] [2025-03-03 18:27:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:15,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:15,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:15,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:15,192 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03 18:27:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:15,282 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-03-03 18:27:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:15,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-03-03 18:27:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:15,288 INFO L225 Difference]: With dead ends: 229 [2025-03-03 18:27:15,288 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 18:27:15,290 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-03 18:27:15,291 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:15,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 18:27:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-03 18:27:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 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-03 18:27:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-03-03 18:27:15,317 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-03-03 18:27:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:15,318 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-03-03 18:27:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03 18:27:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-03-03 18:27:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 18:27:15,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:15,319 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] [2025-03-03 18:27:15,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:27:15,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:15,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1440836617, now seen corresponding path program 1 times [2025-03-03 18:27:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:15,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606097302] [2025-03-03 18:27:15,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:15,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 18:27:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 18:27:15,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:15,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:15,460 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-03 18:27:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606097302] [2025-03-03 18:27:15,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606097302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:15,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184955737] [2025-03-03 18:27:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:15,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:15,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:15,464 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03 18:27:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:15,559 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-03 18:27:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-03-03 18:27:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:15,561 INFO L225 Difference]: With dead ends: 230 [2025-03-03 18:27:15,561 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 18:27:15,561 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-03 18:27:15,561 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:15,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 18:27:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-03 18:27:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-03-03 18:27:15,572 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-03-03 18:27:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:15,573 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-03-03 18:27:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03 18:27:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-03-03 18:27:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 18:27:15,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:15,574 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] [2025-03-03 18:27:15,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:27:15,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:15,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash 215247158, now seen corresponding path program 1 times [2025-03-03 18:27:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191221250] [2025-03-03 18:27:15,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:15,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 18:27:15,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 18:27:15,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:15,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:15,907 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-03 18:27:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191221250] [2025-03-03 18:27:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191221250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:15,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148146927] [2025-03-03 18:27:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:15,909 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-03 18:27:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:16,083 INFO L93 Difference]: Finished difference Result 236 states and 344 transitions. [2025-03-03 18:27:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:27:16,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-03-03 18:27:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:16,084 INFO L225 Difference]: With dead ends: 236 [2025-03-03 18:27:16,084 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 18:27:16,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:27:16,085 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 178 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:16,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 604 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:27:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 18:27:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2025-03-03 18:27:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 145 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:27:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2025-03-03 18:27:16,089 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 43 [2025-03-03 18:27:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2025-03-03 18:27:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-03 18:27:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2025-03-03 18:27:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 18:27:16,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:16,090 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] [2025-03-03 18:27:16,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:27:16,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:16,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 377495904, now seen corresponding path program 1 times [2025-03-03 18:27:16,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:16,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899766829] [2025-03-03 18:27:16,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:16,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 18:27:16,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 18:27:16,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:16,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:27:16,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:27:16,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 18:27:16,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 18:27:16,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:16,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:27:16,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:27:16,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:27:16,210 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:27:16,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:27:16,214 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 18:27:16,241 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:27:16,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:27:16,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:27:16 BoogieIcfgContainer [2025-03-03 18:27:16,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:27:16,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:27:16,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:27:16,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:27:16,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:14" (3/4) ... [2025-03-03 18:27:16,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:27:16,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:27:16,263 INFO L158 Benchmark]: Toolchain (without parser) took 3049.77ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 60.7MB in the end (delta: 51.6MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2025-03-03 18:27:16,263 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:16,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 90.6MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:27:16,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.35ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:27:16,264 INFO L158 Benchmark]: Boogie Preprocessor took 89.07ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 68.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:16,264 INFO L158 Benchmark]: IcfgBuilder took 866.75ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 48.5MB in the end (delta: 20.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-03-03 18:27:16,264 INFO L158 Benchmark]: TraceAbstraction took 1735.98ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 60.8MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:16,265 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 10.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:16,266 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.13ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 90.6MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.35ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 77.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.07ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 68.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 866.75ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 48.5MB in the end (delta: 20.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1735.98ms. Allocated memory is still 142.6MB. Free memory was 47.8MB in the beginning and 60.8MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 10.2kB). There was no memory consumed. 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 bitwiseAnd at line 170. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_69 mask_SORT_69 = (SORT_69)-1 >> (sizeof(SORT_69) * 8 - 10); [L39] const SORT_69 msb_SORT_69 = (SORT_69)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_69 var_70 = 0; [L45] const SORT_10 var_97 = 104; [L46] const SORT_10 var_151 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_1 input_34; [L55] SORT_31 input_36; [L56] SORT_1 input_38; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_1 input_48; [L60] SORT_3 input_52; [L61] SORT_1 input_55; [L62] SORT_1 input_65; [L63] SORT_1 input_73; [L64] SORT_1 input_79; [L65] SORT_1 input_80; [L66] SORT_1 input_91; [L67] SORT_1 input_92; [L68] SORT_1 input_93; [L69] SORT_1 input_107; [L70] SORT_1 input_113; [L71] SORT_1 input_119; [L72] SORT_1 input_125; [L73] SORT_1 input_126; [L74] SORT_1 input_127; [L75] SORT_1 input_141; [L76] SORT_69 input_149; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L78] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L79] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L80] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L81] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L82] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L83] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L84] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L87] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L88] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L89] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_69 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L90] SORT_69 state_71 = __VERIFIER_nondet_ushort() & mask_SORT_69; [L92] SORT_1 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_15_arg_1 = var_7; [L95] state_14 = init_15_arg_1 [L96] SORT_1 init_26_arg_1 = var_7; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_7; [L99] state_27 = init_28_arg_1 [L100] SORT_1 init_41_arg_1 = var_7; [L101] state_40 = init_41_arg_1 [L102] SORT_1 init_43_arg_1 = var_7; [L103] state_42 = init_43_arg_1 [L104] SORT_1 init_51_arg_1 = var_21; [L105] state_50 = init_51_arg_1 [L106] SORT_1 init_58_arg_1 = var_7; [L107] state_57 = init_58_arg_1 [L108] SORT_1 init_60_arg_1 = var_7; [L109] state_59 = init_60_arg_1 [L110] SORT_1 init_62_arg_1 = var_7; [L111] state_61 = init_62_arg_1 [L112] SORT_1 init_64_arg_1 = var_7; [L113] state_63 = init_64_arg_1 [L114] SORT_1 init_68_arg_1 = var_7; [L115] state_67 = init_68_arg_1 [L116] SORT_69 init_72_arg_1 = var_70; [L117] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_29 = __VERIFIER_nondet_uchar() [L125] input_32 = __VERIFIER_nondet_uchar() [L126] input_34 = __VERIFIER_nondet_uchar() [L127] input_36 = __VERIFIER_nondet_uchar() [L128] input_38 = __VERIFIER_nondet_uchar() [L129] input_44 = __VERIFIER_nondet_uchar() [L130] input_46 = __VERIFIER_nondet_uchar() [L131] input_48 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_55 = __VERIFIER_nondet_uchar() [L134] input_65 = __VERIFIER_nondet_uchar() [L135] input_73 = __VERIFIER_nondet_uchar() [L136] input_79 = __VERIFIER_nondet_uchar() [L137] input_80 = __VERIFIER_nondet_uchar() [L138] input_91 = __VERIFIER_nondet_uchar() [L139] input_92 = __VERIFIER_nondet_uchar() [L140] input_93 = __VERIFIER_nondet_uchar() [L141] input_107 = __VERIFIER_nondet_uchar() [L142] input_113 = __VERIFIER_nondet_uchar() [L143] input_119 = __VERIFIER_nondet_uchar() [L144] input_125 = __VERIFIER_nondet_uchar() [L145] input_126 = __VERIFIER_nondet_uchar() [L146] input_127 = __VERIFIER_nondet_uchar() [L147] input_141 = __VERIFIER_nondet_uchar() [L148] input_149 = __VERIFIER_nondet_ushort() [L151] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_11_arg_0=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L152] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_13=1, var_151=1, var_16_arg_0=0, var_21=1, var_70=0, var_7=0, var_97=104] [L158] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_13=1, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L158] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L159] SORT_10 var_16 = var_16_arg_0; [L160] SORT_10 var_17_arg_0 = var_16; [L161] SORT_10 var_17_arg_1 = var_12; [L162] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L163] SORT_1 var_18_arg_0 = var_13; [L164] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_70=0, var_7=0, var_97=104] [L165] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L165] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L166] SORT_1 var_22_arg_0 = var_18; [L167] SORT_1 var_22 = ~var_22_arg_0; [L168] SORT_1 var_23_arg_0 = var_21; [L169] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_70=0, var_7=0, var_97=104] [L170] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L170] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L171] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L171] var_23 = var_23 & mask_SORT_1 [L172] SORT_1 bad_24_arg_0 = var_23; [L173] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 1611 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1118 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 433 IncrementalHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 493 mSDtfsCounter, 433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-03 18:27:16,283 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.vcegar_QF_BV_itc99_b13_p12.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 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:27:18,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:27:18,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:27:18,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:27:18,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:27:18,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:27:18,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:27:18,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:27:18,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:27:18,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:27:18,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:27:18,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:27:18,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:27:18,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:27:18,167 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:27:18,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:27:18,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:27:18,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:27:18,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:27:18,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:27:18,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:27:18,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:18,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:27:18,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:27:18,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:27:18,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:27:18,169 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:27:18,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:27:18,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:27:18,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:27:18,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:27:18,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:27:18,170 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 -> 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 [2025-03-03 18:27:18,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:27:18,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:27:18,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:27:18,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:27:18,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:27:18,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:19,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bdba297/68b94775bdbc4aea8758fc2a40549e1f/FLAG9e377d8ec [2025-03-03 18:27:19,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:27:19,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:19,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bdba297/68b94775bdbc4aea8758fc2a40549e1f/FLAG9e377d8ec [2025-03-03 18:27:20,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75bdba297/68b94775bdbc4aea8758fc2a40549e1f [2025-03-03 18:27:20,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:27:20,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:27:20,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:20,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:27:20,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:27:20,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc31253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20, skipping insertion in model container [2025-03-03 18:27:20,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:27:20,233 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.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-03 18:27:20,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:20,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:27:20,322 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.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-03 18:27:20,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:27:20,381 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:27:20,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20 WrapperNode [2025-03-03 18:27:20,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:27:20,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:20,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:27:20,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:27:20,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,421 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 482 [2025-03-03 18:27:20,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:27:20,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:27:20,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:27:20,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:27:20,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,451 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-03 18:27:20,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:27:20,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:27:20,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:27:20,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:27:20,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (1/1) ... [2025-03-03 18:27:20,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:27:20,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:20,500 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-03 18:27:20,503 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-03 18:27:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:27:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:27:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:27:20,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:27:20,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:27:20,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:27:20,901 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-03 18:27:20,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:27:20,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:27:20,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:27:20,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:20 BoogieIcfgContainer [2025-03-03 18:27:20,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:27:20,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:27:20,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:27:20,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:27:20,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:27:20" (1/3) ... [2025-03-03 18:27:20,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74eccb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:20, skipping insertion in model container [2025-03-03 18:27:20,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:20" (2/3) ... [2025-03-03 18:27:20,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74eccb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:20, skipping insertion in model container [2025-03-03 18:27:20,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:20" (3/3) ... [2025-03-03 18:27:20,916 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-03 18:27:20,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:27:20,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:27:20,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:27:20,963 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;@145c8c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:27:20,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:27:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-03 18:27:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:27:20,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:20,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:27:20,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:20,974 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:27:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:27:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135884515] [2025-03-03 18:27:20,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:20,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:20,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:20,983 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-03 18:27:20,984 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-03 18:27:21,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:27:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:27:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:21,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:21,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 18:27:21,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:21,273 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-03 18:27:21,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:27:21,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:27:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135884515] [2025-03-03 18:27:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135884515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372478082] [2025-03-03 18:27:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:21,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:21,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:27:21,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:21,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:21,293 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 18:27:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:21,336 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:27:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-03 18:27:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:21,342 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:27:21,344 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:27:21,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:27:21,348 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-03 18:27:21,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:27:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:27:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:27:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-03 18:27:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:27:21,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:27:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:21,368 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:27:21,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 18:27:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:27:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:27:21,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:21,368 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:21,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:27:21,569 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-03 18:27:21,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:21,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:27:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:27:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120527251] [2025-03-03 18:27:21,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:21,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:21,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:21,573 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-03 18:27:21,574 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-03 18:27:21,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:27:21,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:27:21,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:21,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:21,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 18:27:21,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:22,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:27:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:26,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:27:26,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120527251] [2025-03-03 18:27:26,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120527251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:26,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:27:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:27:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594213151] [2025-03-03 18:27:26,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:27:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:27:26,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:27:26,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:27:26,693 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-03 18:27:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:26,774 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 18:27:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:27:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-03-03 18:27:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:26,775 INFO L225 Difference]: With dead ends: 15 [2025-03-03 18:27:26,775 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 18:27:26,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:27:26,775 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:26,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:27:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 18:27:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 18:27:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-03 18:27:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 18:27:26,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 18:27:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:26,778 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 18:27:26,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-03 18:27:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 18:27:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 18:27:26,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:26,779 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 18:27:26,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:27:26,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:26,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:26,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 18:27:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:27:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933050454] [2025-03-03 18:27:26,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:27:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:27:26,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:27:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:27:27,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 18:27:27,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 18:27:27,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:27:27,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:27,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 18:27:27,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:27:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:27:27,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:27:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 18:27:27,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:27:27,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933050454] [2025-03-03 18:27:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933050454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:27:27,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:27:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2025-03-03 18:27:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566985646] [2025-03-03 18:27:27,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:27:27,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:27:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:27:27,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:27:27,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:27,676 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-03 18:27:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:27,836 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-03 18:27:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:27:27,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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 11 [2025-03-03 18:27:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:27,837 INFO L225 Difference]: With dead ends: 13 [2025-03-03 18:27:27,837 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 18:27:27,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:27:27,837 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:27,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:27:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 18:27:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 18:27:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03 18:27:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 18:27:27,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-03-03 18:27:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:27,840 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 18:27:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-03 18:27:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 18:27:27,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 18:27:27,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:27:27,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:27:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:27:28,046 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-03 18:27:28,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 18:27:28,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:27:28,110 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-03 18:27:28,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:27:28 BoogieIcfgContainer [2025-03-03 18:27:28,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:27:28,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:27:28,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:27:28,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:27:28,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:20" (3/4) ... [2025-03-03 18:27:28,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 18:27:28,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 18:27:28,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 18:27:28,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 18:27:28,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 18:27:28,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 18:27:28,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 18:27:28,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:27:28,208 INFO L158 Benchmark]: Toolchain (without parser) took 8092.38ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 92.3MB in the beginning and 240.1MB in the end (delta: -147.8MB). Peak memory consumption was 137.0MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,208 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:28,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.88ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 71.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.35ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 68.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,209 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 64.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:27:28,209 INFO L158 Benchmark]: IcfgBuilder took 435.61ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 77.2MB in the end (delta: -13.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,210 INFO L158 Benchmark]: TraceAbstraction took 7201.42ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 76.5MB in the beginning and 248.5MB in the end (delta: -172.0MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,210 INFO L158 Benchmark]: Witness Printer took 94.26ms. Allocated memory is still 402.7MB. Free memory was 248.5MB in the beginning and 240.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:27:28,212 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.22ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.88ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 71.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.35ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 68.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 64.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 435.61ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 77.2MB in the end (delta: -13.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7201.42ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 76.5MB in the beginning and 248.5MB in the end (delta: -172.0MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Witness Printer took 94.26ms. Allocated memory is still 402.7MB. Free memory was 248.5MB in the beginning and 240.1MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 11 QuantifiedInterpolants, 12433 SizeOfPredicates, 24 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Location Invariant Derived location invariant: (((0 == state_14) && (0 == var_12)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-03-03 18:27:28,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE