./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.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.vis_arrays_vsaR_p04.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 a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:09,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:09,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:32:09,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:09,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:09,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:09,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:09,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:09,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:09,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:09,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:09,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:09,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:09,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:09,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:09,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:09,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:09,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:09,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:09,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:32:09,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:32:09,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:09,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:09,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:09,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:09,537 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 -> a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 [2025-03-03 18:32:09,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:09,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:09,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:09,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:09,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:09,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:10,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e6051e3/9e2c80e176ed48b7bbaa6689e6a9d3ca/FLAGb7c9e488e [2025-03-03 18:32:11,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:11,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:11,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e6051e3/9e2c80e176ed48b7bbaa6689e6a9d3ca/FLAGb7c9e488e [2025-03-03 18:32:11,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e6051e3/9e2c80e176ed48b7bbaa6689e6a9d3ca [2025-03-03 18:32:11,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:11,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:11,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:11,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:11,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:11,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36afc31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11, skipping insertion in model container [2025-03-03 18:32:11,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:11,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2025-03-03 18:32:11,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:11,393 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:11,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2025-03-03 18:32:11,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:11,423 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:11,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11 WrapperNode [2025-03-03 18:32:11,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:11,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:11,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:11,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:11,430 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:32:11" (1/1) ... [2025-03-03 18:32:11,439 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:32:11" (1/1) ... [2025-03-03 18:32:11,476 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 191 [2025-03-03 18:32:11,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:11,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:11,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:11,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:11,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,510 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:32:11,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:11,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:11,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:11,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:11,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (1/1) ... [2025-03-03 18:32:11,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:11,564 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:32:11,568 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:32:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:32:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:11,652 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:11,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:11,918 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:11,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:11,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:11,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:11,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:11 BoogieIcfgContainer [2025-03-03 18:32:11,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:11,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:11,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:11,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:11,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:11" (1/3) ... [2025-03-03 18:32:11,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5b5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:11, skipping insertion in model container [2025-03-03 18:32:11,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:11" (2/3) ... [2025-03-03 18:32:11,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5b5b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:11, skipping insertion in model container [2025-03-03 18:32:11,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:11" (3/3) ... [2025-03-03 18:32:11,952 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:11,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:11,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c that has 1 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:12,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:12,017 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;@420d2bd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:12,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 18:32:12,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:12,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:12,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:12,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash 474001933, now seen corresponding path program 1 times [2025-03-03 18:32:12,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:12,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895021166] [2025-03-03 18:32:12,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:12,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 18:32:12,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 18:32:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:12,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:12,472 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:32:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895021166] [2025-03-03 18:32:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895021166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662336981] [2025-03-03 18:32:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:12,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:12,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:12,495 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:32:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:12,546 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2025-03-03 18:32:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-03 18:32:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:12,553 INFO L225 Difference]: With dead ends: 69 [2025-03-03 18:32:12,553 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 18:32:12,555 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:32:12,557 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:12,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:32:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 18:32:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 18:32:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 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:32:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-03 18:32:12,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 17 [2025-03-03 18:32:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:12,579 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-03 18:32:12,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:32:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-03 18:32:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 18:32:12,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:12,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:32:12,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1813837187, now seen corresponding path program 1 times [2025-03-03 18:32:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-03-03 18:32:12,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:12,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 18:32:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 18:32:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:12,718 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:32:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903990726] [2025-03-03 18:32:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903990726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620845979] [2025-03-03 18:32:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:12,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:12,721 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:32:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:12,765 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2025-03-03 18:32:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 18 [2025-03-03 18:32:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:12,766 INFO L225 Difference]: With dead ends: 70 [2025-03-03 18:32:12,767 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 18:32:12,767 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:32:12,767 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:12,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:32:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 18:32:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-03 18:32:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-03 18:32:12,773 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 18 [2025-03-03 18:32:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:12,773 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-03 18:32:12,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:32:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-03 18:32:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 18:32:12,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:12,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:32:12,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1969080120, now seen corresponding path program 1 times [2025-03-03 18:32:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-03-03 18:32:12,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 18:32:12,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 18:32:12,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:12,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:13,006 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:32:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-03-03 18:32:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324520816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012755967] [2025-03-03 18:32:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:13,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:13,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:13,009 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:32:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:13,096 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2025-03-03 18:32:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-03-03 18:32:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:13,097 INFO L225 Difference]: With dead ends: 76 [2025-03-03 18:32:13,097 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 18:32:13,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:32:13,098 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:13,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 131 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:32:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 18:32:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-03 18:32:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-03 18:32:13,106 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 19 [2025-03-03 18:32:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-03 18:32:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:32:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-03 18:32:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 18:32:13,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:13,108 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] [2025-03-03 18:32:13,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:32:13,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash 976420936, now seen corresponding path program 1 times [2025-03-03 18:32:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949545132] [2025-03-03 18:32:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:13,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 18:32:13,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 18:32:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:13,341 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:32:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949545132] [2025-03-03 18:32:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949545132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:32:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995683] [2025-03-03 18:32:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:32:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:13,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:32:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:13,343 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:32:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:13,411 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2025-03-03 18:32:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 20 [2025-03-03 18:32:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:13,413 INFO L225 Difference]: With dead ends: 82 [2025-03-03 18:32:13,414 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 18:32:13,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:13,415 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:13,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 168 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:32:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 18:32:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-03 18:32:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-03 18:32:13,422 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 20 [2025-03-03 18:32:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:13,422 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-03 18:32:13,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:32:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-03 18:32:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 18:32:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:13,424 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] [2025-03-03 18:32:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:32:13,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:13,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1325644147, now seen corresponding path program 1 times [2025-03-03 18:32:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147641364] [2025-03-03 18:32:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:13,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 18:32:13,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 18:32:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:13,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:32:13,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:32:13,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 18:32:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 18:32:13,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:13,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:32:13,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:32:13,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:32:13,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:32:13,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:32:13,522 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:32:13,537 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 18:32:13,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:32:13,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:32:13 BoogieIcfgContainer [2025-03-03 18:32:13,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:32:13,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:32:13,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:32:13,550 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:32:13,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:11" (3/4) ... [2025-03-03 18:32:13,552 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:32:13,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:32:13,553 INFO L158 Benchmark]: Toolchain (without parser) took 2337.59ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 99.4MB in the end (delta: 14.5MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-03-03 18:32:13,553 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:13,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.38ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 101.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:32:13,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 97.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:13,554 INFO L158 Benchmark]: Boogie Preprocessor took 55.11ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:13,554 INFO L158 Benchmark]: IcfgBuilder took 408.65ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 71.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:32:13,555 INFO L158 Benchmark]: TraceAbstraction took 1605.55ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 100.6MB in the end (delta: -30.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:13,555 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:32:13,556 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.38ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 101.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 97.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.11ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 408.65ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 71.2MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1605.55ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 100.6MB in the end (delta: -30.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.4MB in the end (delta: 1.2MB). 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 106. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 2); [L39] const SORT_14 msb_SORT_14 = (SORT_14)1 << (2 - 1); [L41] const SORT_7 var_8 = 0; [L42] const SORT_1 var_12 = 0; [L43] const SORT_14 var_16 = 0; [L44] const SORT_1 var_21 = 1; [L45] const SORT_7 var_50 = 1; [L46] const SORT_7 var_52 = 4; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_5 input_6; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_3 input_29; [L54] SORT_1 input_31; [L55] SORT_5 input_33; [L56] SORT_3 input_35; [L57] SORT_3 input_37; [L58] SORT_3 input_39; [L59] SORT_3 input_41; [L60] SORT_3 input_43; [L61] SORT_3 input_45; [L62] SORT_3 input_47; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L64] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L66] SORT_7 init_10_arg_1 = var_8; [L67] state_9 = init_10_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L70] input_2 = __VERIFIER_nondet_uchar() [L71] input_4 = __VERIFIER_nondet_uchar() [L72] input_6 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_uchar() [L74] input_27 = __VERIFIER_nondet_uchar() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_uchar() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_35 = __VERIFIER_nondet_uchar() [L79] input_37 = __VERIFIER_nondet_uchar() [L80] input_39 = __VERIFIER_nondet_uchar() [L81] input_41 = __VERIFIER_nondet_uchar() [L82] input_43 = __VERIFIER_nondet_uchar() [L83] input_45 = __VERIFIER_nondet_uchar() [L84] input_47 = __VERIFIER_nondet_uchar() [L87] SORT_7 var_11_arg_0 = state_9; [L88] SORT_1 var_11 = var_11_arg_0 >> 2; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_11=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L89] EXPR var_11 & mask_SORT_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L89] var_11 = var_11 & mask_SORT_1 [L90] SORT_1 var_13_arg_0 = var_11; [L91] SORT_1 var_13_arg_1 = var_12; [L92] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L93] SORT_7 var_15_arg_0 = state_9; [L94] SORT_14 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_13=1, var_15=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L95] EXPR var_15 & mask_SORT_14 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_13=1, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L95] var_15 = var_15 & mask_SORT_14 [L96] SORT_14 var_17_arg_0 = var_15; [L97] SORT_14 var_17_arg_1 = var_16; [L98] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L99] SORT_1 var_18_arg_0 = var_13; [L100] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_50=1, var_52=4, var_8=0] [L101] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L101] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L102] SORT_1 var_22_arg_0 = var_18; [L103] SORT_1 var_22 = ~var_22_arg_0; [L104] SORT_1 var_23_arg_0 = var_21; [L105] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_50=1, var_52=4, var_8=0] [L106] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L106] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L107] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_14=3, mask_SORT_1=1, mask_SORT_7=7, state_9=0, var_12=0, var_16=0, var_21=1, var_50=1, var_52=4, var_8=0] [L107] var_23 = var_23 & mask_SORT_1 [L108] SORT_1 bad_24_arg_0 = var_23; [L109] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 152 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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:32:13,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.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 a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:32:15,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:32:15,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 18:32:15,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:32:15,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:32:15,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:32:15,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:32:15,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:32:15,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:32:15,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:32:15,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:32:15,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:32:15,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:32:15,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:32:15,465 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:32:15,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:32:15,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:15,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:32:15,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:32:15,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:32:15,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:32:15,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:32:15,470 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 -> a85f457a181079a0b5789d13788d6c7347ae80776212b7f747148ec13e9b6cf1 [2025-03-03 18:32:15,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:32:15,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:32:15,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:32:15,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:32:15,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:32:15,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:16,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212669b11/0fdd6a5e88504ec49106e4cdb8e7c534/FLAG7a55dfcbc [2025-03-03 18:32:17,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:32:17,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:17,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212669b11/0fdd6a5e88504ec49106e4cdb8e7c534/FLAG7a55dfcbc [2025-03-03 18:32:17,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212669b11/0fdd6a5e88504ec49106e4cdb8e7c534 [2025-03-03 18:32:17,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:32:17,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:32:17,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:17,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:32:17,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:32:17,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75310058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17, skipping insertion in model container [2025-03-03 18:32:17,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:32:17,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2025-03-03 18:32:17,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:17,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:32:17,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2025-03-03 18:32:17,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:32:17,328 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:32:17,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17 WrapperNode [2025-03-03 18:32:17,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:32:17,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:17,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:32:17,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:32:17,335 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:32:17" (1/1) ... [2025-03-03 18:32:17,344 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:32:17" (1/1) ... [2025-03-03 18:32:17,363 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2025-03-03 18:32:17,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:32:17,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:32:17,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:32:17,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:32:17,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,381 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:32:17,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:32:17,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:32:17,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:32:17,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:32:17,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (1/1) ... [2025-03-03 18:32:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:32:17,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:17,432 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:32:17,438 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:32:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:32:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:32:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:32:17,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:32:17,520 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:32:17,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:32:17,670 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-03 18:32:17,670 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:32:17,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:32:17,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:32:17,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:17 BoogieIcfgContainer [2025-03-03 18:32:17,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:32:17,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:32:17,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:32:17,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:32:17,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:32:17" (1/3) ... [2025-03-03 18:32:17,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fceca4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:17, skipping insertion in model container [2025-03-03 18:32:17,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:32:17" (2/3) ... [2025-03-03 18:32:17,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fceca4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:32:17, skipping insertion in model container [2025-03-03 18:32:17,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:17" (3/3) ... [2025-03-03 18:32:17,684 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c [2025-03-03 18:32:17,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:32:17,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:32:17,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:32:17,735 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;@63d2ab40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:32:17,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:32:17,739 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:32:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 18:32:17,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:17,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 18:32:17,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:17,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 18:32:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:17,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361442848] [2025-03-03 18:32:17,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:17,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:17,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:17,758 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:32:17,759 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:32:17,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 18:32:17,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 18:32:17,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:17,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:17,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 18:32:17,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:18,027 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:32:18,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:32:18,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361442848] [2025-03-03 18:32:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361442848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:32:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392118167] [2025-03-03 18:32:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:32:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:18,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:32:18,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:32:18,046 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:32:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:18,079 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 18:32:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:32:18,082 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:32:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:18,088 INFO L225 Difference]: With dead ends: 18 [2025-03-03 18:32:18,088 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 18:32:18,090 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:32:18,091 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:32:18,092 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:32:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 18:32:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 18:32:18,109 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:32:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 18:32:18,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 18:32:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 18:32:18,114 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:32:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 18:32:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 18:32:18,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:18,114 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:18,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:32:18,315 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:32:18,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 18:32:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280113518] [2025-03-03 18:32:18,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:18,323 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:32:18,323 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:32:18,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 18:32:18,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 18:32:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:18,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:32:18,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:18,598 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:32:18,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:32:23,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_9~0#1|))) (let ((.cse5 (= .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_52~0#1|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)))) (.cse1 (not .cse5)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_50~0#1|))))))) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (and (or (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32)))))))))) .cse5))) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32))))))))) .cse5)) (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))) (_ bv0 8)))))))) is different from false [2025-03-03 18:32:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-03 18:32:24,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280113518] [2025-03-03 18:32:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280113518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:32:24,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:32:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 18:32:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406161210] [2025-03-03 18:32:24,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:32:24,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:32:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:24,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:32:24,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2025-03-03 18:32:24,559 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:32:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:25,104 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 18:32:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:32:25,105 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:32:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:25,106 INFO L225 Difference]: With dead ends: 15 [2025-03-03 18:32:25,106 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 18:32:25,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=50, Invalid=85, Unknown=1, NotChecked=20, Total=156 [2025-03-03 18:32:25,107 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:25,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2025-03-03 18:32:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 18:32:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 18:32:25,111 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:32:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 18:32:25,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 18:32:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 18:32:25,112 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:32:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 18:32:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 18:32:25,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:25,113 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 18:32:25,119 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:32:25,313 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:32:25,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:25,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 18:32:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688751701] [2025-03-03 18:32:25,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 18:32:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:25,317 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:32:25,318 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:32:25,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 18:32:25,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 18:32:25,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 18:32:25,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:25,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 18:32:25,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:27,084 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:32:27,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:32:33,646 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:32:33,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:32:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688751701] [2025-03-03 18:32:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688751701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:32:33,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:32:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-03 18:32:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217170714] [2025-03-03 18:32:33,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:32:33,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:32:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:32:33,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:32:33,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:32:33,650 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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:32:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:38,269 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-03 18:32:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:32:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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:32:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:38,270 INFO L225 Difference]: With dead ends: 24 [2025-03-03 18:32:38,270 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 18:32:38,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:32:38,271 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:38,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:32:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 18:32:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-03-03 18:32:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:32:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-03 18:32:38,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2025-03-03 18:32:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:38,275 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-03 18:32:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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:32:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-03 18:32:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 18:32:38,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:38,276 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2025-03-03 18:32:38,282 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:32:38,480 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:32:38,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1811617123, now seen corresponding path program 3 times [2025-03-03 18:32:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:32:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662940922] [2025-03-03 18:32:38,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 18:32:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:38,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:38,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:32:38,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-03 18:32:38,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 20 statements. [2025-03-03 18:32:38,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 18:32:38,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:38,573 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-03 18:32:38,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 18:32:42,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:33:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 18:33:08,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:33:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662940922] [2025-03-03 18:33:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662940922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:33:08,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:33:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-03 18:33:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141410991] [2025-03-03 18:33:08,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 18:33:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:33:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:33:08,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:33:08,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:33:08,978 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:33:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:33:09,679 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-03-03 18:33:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:33:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 20 [2025-03-03 18:33:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:33:09,680 INFO L225 Difference]: With dead ends: 21 [2025-03-03 18:33:09,680 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 18:33:09,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:33:09,681 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:33:09,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:33:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 18:33:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 18:33:09,681 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:33:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 18:33:09,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-03-03 18:33:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:33:09,681 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 18:33:09,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:33:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 18:33:09,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 18:33:09,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:33:09,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:33:09,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:33:09,887 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-03 18:33:09,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 18:33:10,596 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:33:10,604 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-03 18:33:10,605 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-03 18:33:10,606 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 18:33:10,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:33:10 BoogieIcfgContainer [2025-03-03 18:33:10,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:33:10,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:33:10,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:33:10,608 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:33:10,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:32:17" (3/4) ... [2025-03-03 18:33:10,610 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 18:33:10,617 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 18:33:10,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 18:33:10,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 18:33:10,618 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 18:33:10,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 18:33:10,679 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 18:33:10,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:33:10,681 INFO L158 Benchmark]: Toolchain (without parser) took 53579.89ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 92.5MB in the beginning and 78.4MB in the end (delta: 14.2MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,681 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.80ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 79.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.09ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: Boogie Preprocessor took 38.10ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: IcfgBuilder took 274.51ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 61.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: TraceAbstraction took 52928.67ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.3MB in the beginning and 84.2MB in the end (delta: -22.9MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,682 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 226.5MB. Free memory was 84.2MB in the beginning and 78.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:33:10,683 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 63.4MB in the beginning and 63.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.80ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 79.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.09ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.10ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.51ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 61.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52928.67ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 61.3MB in the beginning and 84.2MB in the end (delta: -22.9MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 226.5MB. Free memory was 84.2MB in the beginning and 78.4MB in the end (delta: 5.8MB). 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 52.2s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 14 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=3, InterpolantAutomatonStates: 29, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 45.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 32 QuantifiedInterpolants, 38334 SizeOfPredicates, 34 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 33/98 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: 68]: Location Invariant Derived location invariant: (((((((((1 == var_50) && (4 == var_52)) && (7 == mask_SORT_7)) && (0 == var_8)) && (3 == mask_SORT_14)) && (1 == mask_SORT_1)) && (0 == var_16)) && (0 == var_12)) && (1 == var_21)) RESULT: Ultimate proved your program to be correct! [2025-03-03 18:33:10,883 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 Writing output log to file Ultimate.log Result: TRUE