./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:32,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:32,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:37:32,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:32,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:32,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:32,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:32,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:32,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:32,636 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:32,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:32,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:32,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:32,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:32,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:32,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:32,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:32,638 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2025-03-08 09:37:32,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:32,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:32,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:32,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:32,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:32,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:34,020 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7040a2d/f92195b31b2d44cc995c3500f7507bcc/FLAGcc9ded56b [2025-03-08 09:37:34,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:34,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:34,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7040a2d/f92195b31b2d44cc995c3500f7507bcc/FLAGcc9ded56b [2025-03-08 09:37:34,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7040a2d/f92195b31b2d44cc995c3500f7507bcc [2025-03-08 09:37:34,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:34,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:34,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:34,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:34,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:34,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d597279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34, skipping insertion in model container [2025-03-08 09:37:34,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:34,482 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.v_Unidec.c[1248,1261] [2025-03-08 09:37:34,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:34,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:34,614 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.v_Unidec.c[1248,1261] [2025-03-08 09:37:34,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:34,697 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:34,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34 WrapperNode [2025-03-08 09:37:34,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:34,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:34,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:34,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:34,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,800 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1219 [2025-03-08 09:37:34,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:34,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:34,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:34,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:34,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,879 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:37:34,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:34,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:34,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:34,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:34,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (1/1) ... [2025-03-08 09:37:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:35,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:37:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:37:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:37:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:35,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:35,194 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:36,224 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:36,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:36,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:36,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:36,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:36 BoogieIcfgContainer [2025-03-08 09:37:36,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:36,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:36,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:36,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:36,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:34" (1/3) ... [2025-03-08 09:37:36,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104acc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:36, skipping insertion in model container [2025-03-08 09:37:36,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:34" (2/3) ... [2025-03-08 09:37:36,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104acc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:36, skipping insertion in model container [2025-03-08 09:37:36,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:36" (3/3) ... [2025-03-08 09:37:36,294 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:36,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:36,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_Unidec.c that has 1 procedures, 286 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:36,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:36,366 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;@1921ec38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:36,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 1.4964788732394365) internal successors, (425), 285 states have internal predecessors, (425), 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-08 09:37:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 09:37:36,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:36,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:36,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:36,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash -442586797, now seen corresponding path program 1 times [2025-03-08 09:37:36,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988026168] [2025-03-08 09:37:36,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:36,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 09:37:36,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 09:37:36,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:36,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:36,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988026168] [2025-03-08 09:37:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988026168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:36,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111446310] [2025-03-08 09:37:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:36,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:36,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:36,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:36,823 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 1.4964788732394365) internal successors, (425), 285 states have internal predecessors, (425), 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 5.25) internal successors, (21), 4 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-08 09:37:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:37,000 INFO L93 Difference]: Finished difference Result 557 states and 831 transitions. [2025-03-08 09:37:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:37,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) Word has length 21 [2025-03-08 09:37:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:37,008 INFO L225 Difference]: With dead ends: 557 [2025-03-08 09:37:37,009 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 09:37:37,013 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-08 09:37:37,017 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1045 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 09:37:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-08 09:37:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.4894366197183098) internal successors, (423), 284 states have internal predecessors, (423), 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-08 09:37:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 423 transitions. [2025-03-08 09:37:37,056 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 423 transitions. Word has length 21 [2025-03-08 09:37:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:37,056 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 423 transitions. [2025-03-08 09:37:37,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-08 09:37:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 423 transitions. [2025-03-08 09:37:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 09:37:37,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:37,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:37,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:37:37,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:37,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash -830609247, now seen corresponding path program 1 times [2025-03-08 09:37:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909784558] [2025-03-08 09:37:37,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:37,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 09:37:37,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 09:37:37,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:37,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:37,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909784558] [2025-03-08 09:37:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909784558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583245387] [2025-03-08 09:37:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:37,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:37,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:37,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:37,217 INFO L87 Difference]: Start difference. First operand 285 states and 423 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 09:37:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:37,382 INFO L93 Difference]: Finished difference Result 558 states and 829 transitions. [2025-03-08 09:37:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-03-08 09:37:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:37,384 INFO L225 Difference]: With dead ends: 558 [2025-03-08 09:37:37,384 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 09:37:37,385 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-08 09:37:37,385 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:37,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1042 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 09:37:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-08 09:37:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.486013986013986) internal successors, (425), 286 states have internal predecessors, (425), 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-08 09:37:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 425 transitions. [2025-03-08 09:37:37,402 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 425 transitions. Word has length 22 [2025-03-08 09:37:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 425 transitions. [2025-03-08 09:37:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 09:37:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 425 transitions. [2025-03-08 09:37:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 09:37:37,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:37,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:37,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:37:37,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1952426766, now seen corresponding path program 1 times [2025-03-08 09:37:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653823223] [2025-03-08 09:37:37,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:37,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 09:37:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 09:37:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653823223] [2025-03-08 09:37:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653823223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564056152] [2025-03-08 09:37:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:37,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:37,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:37,597 INFO L87 Difference]: Start difference. First operand 287 states and 425 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 09:37:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:37,749 INFO L93 Difference]: Finished difference Result 558 states and 828 transitions. [2025-03-08 09:37:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:37,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-03-08 09:37:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:37,751 INFO L225 Difference]: With dead ends: 558 [2025-03-08 09:37:37,751 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 09:37:37,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:37:37,751 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 406 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:37,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 691 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 09:37:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-08 09:37:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.482394366197183) internal successors, (421), 284 states have internal predecessors, (421), 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-08 09:37:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 421 transitions. [2025-03-08 09:37:37,758 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 421 transitions. Word has length 23 [2025-03-08 09:37:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:37,758 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 421 transitions. [2025-03-08 09:37:37,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 09:37:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 421 transitions. [2025-03-08 09:37:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 09:37:37,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:37,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:37,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:37:37,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:37,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1857415965, now seen corresponding path program 1 times [2025-03-08 09:37:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773124093] [2025-03-08 09:37:37,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:37,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 09:37:37,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 09:37:37,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:37,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:37,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:37:37,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 09:37:37,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 09:37:37,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:37,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:37:37,874 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:37:37,874 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:37:37,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:37:37,877 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:37:37,903 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:37:37,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:37:37,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:37:37 BoogieIcfgContainer [2025-03-08 09:37:37,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:37:37,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:37:37,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:37:37,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:37:37,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:36" (3/4) ... [2025-03-08 09:37:37,917 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:37:37,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:37:37,918 INFO L158 Benchmark]: Toolchain (without parser) took 3569.62ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 104.5MB in the beginning and 183.4MB in the end (delta: -78.9MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,919 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:37,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.65ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 74.1MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.13ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 48.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,920 INFO L158 Benchmark]: Boogie Preprocessor took 181.93ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 88.8MB in the end (delta: -40.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,920 INFO L158 Benchmark]: IcfgBuilder took 1302.52ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 88.8MB in the beginning and 214.5MB in the end (delta: -125.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,920 INFO L158 Benchmark]: TraceAbstraction took 1625.94ms. Allocated memory is still 302.0MB. Free memory was 213.7MB in the beginning and 183.4MB in the end (delta: 30.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-03-08 09:37:37,921 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 302.0MB. Free memory was 183.4MB in the beginning and 183.4MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:37,922 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.65ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 74.1MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.13ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 48.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 181.93ms. Allocated memory is still 142.6MB. Free memory was 48.0MB in the beginning and 88.8MB in the end (delta: -40.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1302.52ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 88.8MB in the beginning and 214.5MB in the end (delta: -125.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1625.94ms. Allocated memory is still 302.0MB. Free memory was 213.7MB in the beginning and 183.4MB in the end (delta: 30.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 302.0MB. Free memory was 183.4MB in the beginning and 183.4MB in the end (delta: 37.1kB). 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 161. 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 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L38] const SORT_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 16); [L39] const SORT_22 msb_SORT_22 = (SORT_22)1 << (16 - 1); [L41] const SORT_68 mask_SORT_68 = (SORT_68)-1 >> (sizeof(SORT_68) * 8 - 13); [L42] const SORT_68 msb_SORT_68 = (SORT_68)1 << (13 - 1); [L44] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 6); [L45] const SORT_71 msb_SORT_71 = (SORT_71)1 << (6 - 1); [L47] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 10); [L48] const SORT_73 msb_SORT_73 = (SORT_73)1 << (10 - 1); [L50] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 9); [L51] const SORT_79 msb_SORT_79 = (SORT_79)1 << (9 - 1); [L53] const SORT_81 mask_SORT_81 = (SORT_81)-1 >> (sizeof(SORT_81) * 8 - 7); [L54] const SORT_81 msb_SORT_81 = (SORT_81)1 << (7 - 1); [L56] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 12); [L57] const SORT_84 msb_SORT_84 = (SORT_84)1 << (12 - 1); [L59] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L60] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L62] const SORT_1 var_7 = 0; [L63] const SORT_10 var_12 = 0; [L64] const SORT_1 var_16 = 1; [L65] const SORT_22 var_23 = 8; [L66] const SORT_22 var_24 = 10; [L67] const SORT_3 var_25 = 1; [L68] const SORT_22 var_28 = 88; [L69] const SORT_22 var_29 = 584; [L70] const SORT_3 var_30 = 3; [L71] const SORT_3 var_33 = 2; [L72] const SORT_22 var_37 = 705; [L73] const SORT_22 var_38 = 611; [L74] const SORT_3 var_39 = 5; [L75] const SORT_22 var_42 = 50825; [L76] const SORT_3 var_43 = 7; [L77] const SORT_3 var_46 = 6; [L78] const SORT_3 var_50 = 4; [L79] const SORT_22 var_65 = 0; [L80] const SORT_3 var_67 = 0; [L81] const SORT_71 var_72 = 0; [L82] const SORT_5 var_76 = 1; [L83] const SORT_79 var_80 = 0; [L84] const SORT_84 var_85 = 0; [L85] const SORT_5 var_89 = 3; [L86] const SORT_5 var_92 = 2; [L87] const SORT_68 var_97 = 1; [L88] const SORT_22 var_100 = 32767; [L89] const SORT_5 var_105 = 0; [L90] const SORT_73 var_119 = 1; [L91] const SORT_81 var_131 = 1; [L92] const SORT_86 var_141 = 1; [L94] SORT_1 input_2; [L95] SORT_3 input_4; [L96] SORT_5 input_6; [L97] SORT_22 input_66; [L98] SORT_22 input_96; [L99] SORT_22 input_108; [L100] SORT_22 input_109; [L101] SORT_22 input_118; [L102] SORT_22 input_130; [L103] SORT_22 input_140; [L104] SORT_22 input_157; [L105] SORT_22 input_166; [L106] SORT_22 input_170; [L107] SORT_22 input_179; [L108] SORT_22 input_181; [L109] SORT_22 input_190; [L110] SORT_22 input_197; [L111] SORT_22 input_201; [L112] SORT_22 input_204; [L113] SORT_22 input_206; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L115] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L116] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_ushort() & mask_SORT_22 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L117] SORT_22 state_58 = __VERIFIER_nondet_ushort() & mask_SORT_22; [L119] SORT_1 init_9_arg_1 = var_7; [L120] state_8 = init_9_arg_1 [L121] SORT_1 init_21_arg_1 = var_16; [L122] state_20 = init_21_arg_1 [L123] SORT_22 init_59_arg_1 = var_23; [L124] state_58 = init_59_arg_1 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L129] input_4 = input_4 & mask_SORT_3 [L130] input_6 = __VERIFIER_nondet_uchar() [L131] EXPR input_6 & mask_SORT_5 VAL [input_4=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, state_8=0, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L131] input_6 = input_6 & mask_SORT_5 [L132] input_66 = __VERIFIER_nondet_ushort() [L133] input_96 = __VERIFIER_nondet_ushort() [L134] input_108 = __VERIFIER_nondet_ushort() [L135] input_109 = __VERIFIER_nondet_ushort() [L136] input_118 = __VERIFIER_nondet_ushort() [L137] input_130 = __VERIFIER_nondet_ushort() [L138] input_140 = __VERIFIER_nondet_ushort() [L139] input_157 = __VERIFIER_nondet_ushort() [L140] input_166 = __VERIFIER_nondet_ushort() [L141] input_170 = __VERIFIER_nondet_ushort() [L142] input_179 = __VERIFIER_nondet_ushort() [L143] input_181 = __VERIFIER_nondet_ushort() [L144] input_190 = __VERIFIER_nondet_ushort() [L145] input_197 = __VERIFIER_nondet_ushort() [L146] input_201 = __VERIFIER_nondet_ushort() [L147] input_204 = __VERIFIER_nondet_ushort() [L148] input_206 = __VERIFIER_nondet_ushort() [L151] SORT_1 var_11_arg_0 = state_8; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_11_arg_0=0, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] EXPR var_11_arg_0 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] SORT_1 var_17_arg_0 = var_13; [L158] SORT_1 var_17 = ~var_17_arg_0; [L159] SORT_1 var_18_arg_0 = var_16; [L160] SORT_1 var_18_arg_1 = var_17; VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_18_arg_0=1, var_18_arg_1=-2, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L161] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L162] EXPR var_18 & mask_SORT_1 VAL [input_4=0, input_6=0, mask_SORT_1=1, mask_SORT_22=65535, mask_SORT_3=7, mask_SORT_5=3, mask_SORT_68=8191, mask_SORT_71=63, mask_SORT_73=1023, mask_SORT_79=511, mask_SORT_81=127, mask_SORT_84=4095, mask_SORT_86=15, state_20=1, state_58=8, var_100=32767, var_105=0, var_119=1, var_12=0, var_131=1, var_141=1, var_16=1, var_23=8, var_24=10, var_25=1, var_28=88, var_29=584, var_30=3, var_33=2, var_37=705, var_38=611, var_39=5, var_42=50825, var_43=7, var_46=6, var_50=4, var_65=0, var_67=0, var_72=0, var_76=1, var_7=0, var_80=0, var_85=0, var_89=3, var_92=2, var_97=1] [L162] var_18 = var_18 & mask_SORT_1 [L163] SORT_1 bad_19_arg_0 = var_18; [L164] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 286 locations, 425 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 2778 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1732 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1046 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:37:37,935 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.v_Unidec.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 c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:39,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:39,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:37:39,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:39,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:39,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:39,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:39,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:39,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:39,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:39,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:39,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:39,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:39,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:39,808 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:37:39,809 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:37:39,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:39,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:39,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:39,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:39,809 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 -> c14eea1490451e84235fd4f93f05fdff3c411b2c5f93e6c8c24af5ce00f88831 [2025-03-08 09:37:40,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:40,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:40,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:40,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:40,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:40,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:41,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7cd484b/c39cf6606f0342b6a8b1e08ce9806e6f/FLAG6ee3bad3b [2025-03-08 09:37:41,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:41,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:41,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7cd484b/c39cf6606f0342b6a8b1e08ce9806e6f/FLAG6ee3bad3b [2025-03-08 09:37:41,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7cd484b/c39cf6606f0342b6a8b1e08ce9806e6f [2025-03-08 09:37:41,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:41,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:41,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:41,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:41,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:41,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:41" (1/1) ... [2025-03-08 09:37:41,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ffc43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:41, skipping insertion in model container [2025-03-08 09:37:41,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:41" (1/1) ... [2025-03-08 09:37:41,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:41,902 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.v_Unidec.c[1248,1261] [2025-03-08 09:37:42,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:42,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:42,022 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.v_Unidec.c[1248,1261] [2025-03-08 09:37:42,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:42,088 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:42,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42 WrapperNode [2025-03-08 09:37:42,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:42,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:42,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:42,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:42,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,139 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 667 [2025-03-08 09:37:42,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:42,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:42,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:42,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:42,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:37:42,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:42,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:42,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:42,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:42,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (1/1) ... [2025-03-08 09:37:42,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:42,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:42,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:37:42,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:37:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:37:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:42,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:42,389 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:42,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:42,940 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:42,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:42,946 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:42,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:42,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:42 BoogieIcfgContainer [2025-03-08 09:37:42,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:42,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:42,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:42,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:42,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:41" (1/3) ... [2025-03-08 09:37:42,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:42, skipping insertion in model container [2025-03-08 09:37:42,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:42" (2/3) ... [2025-03-08 09:37:42,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:42, skipping insertion in model container [2025-03-08 09:37:42,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:42" (3/3) ... [2025-03-08 09:37:42,953 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_Unidec.c [2025-03-08 09:37:42,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:42,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_Unidec.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:42,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:43,000 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;@1080a4bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:43,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:43,004 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-08 09:37:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:37:43,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:43,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:37:43,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:43,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:37:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:37:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426460011] [2025-03-08 09:37:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:43,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:43,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:37:43,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:37:43,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:37:43,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:43,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:43,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 09:37:43,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:37:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:43,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:37:43,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:37:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426460011] [2025-03-08 09:37:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426460011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:43,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751792821] [2025-03-08 09:37:43,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:43,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:37:43,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:43,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:43,341 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-08 09:37:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:43,381 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-08 09:37:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:43,384 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-08 09:37:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:43,388 INFO L225 Difference]: With dead ends: 17 [2025-03-08 09:37:43,388 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 09:37:43,390 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-08 09:37:43,392 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-08 09:37:43,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:37:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 09:37:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 09:37:43,408 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-08 09:37:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:37:43,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:37:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:43,412 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:37:43,412 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-08 09:37:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:37:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:37:43,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:43,413 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:43,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:37:43,617 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-08 09:37:43,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:37:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:37:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942221915] [2025-03-08 09:37:43,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:43,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:43,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:37:43,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:37:43,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:37:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:43,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 09:37:43,798 INFO L279 TraceCheckSpWp]: Computing forward predicates...