./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.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 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:59:17,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:59:17,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:59:17,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:59:17,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:59:17,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:59:17,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:59:17,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:59:17,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:59:17,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:59:17,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:59:17,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:59:17,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:59:17,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:59:17,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:59:17,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:59:17,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:59:17,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:59:17,727 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 -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2025-03-03 16:59:17,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:59:17,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:59:17,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:59:17,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:59:17,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:59:17,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2025-03-03 16:59:19,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e9cbec/d2f54fdc85ec4166bc6074ad3a483051/FLAG616ed9120 [2025-03-03 16:59:19,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:59:19,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2025-03-03 16:59:19,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e9cbec/d2f54fdc85ec4166bc6074ad3a483051/FLAG616ed9120 [2025-03-03 16:59:19,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e9cbec/d2f54fdc85ec4166bc6074ad3a483051 [2025-03-03 16:59:19,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:59:19,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:59:19,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:59:19,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:59:19,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:59:19,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19, skipping insertion in model container [2025-03-03 16:59:19,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:59:19,796 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.cal181.c[1246,1259] [2025-03-03 16:59:19,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:59:19,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:59:19,856 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.cal181.c[1246,1259] [2025-03-03 16:59:19,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:59:19,896 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:59:19,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19 WrapperNode [2025-03-03 16:59:19,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:59:19,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:59:19,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:59:19,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:59:19,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,927 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2025-03-03 16:59:19,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:59:19,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:59:19,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:59:19,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:59:19,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:59:19,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:59:19,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:59:19,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:59:19,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:59:19,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (1/1) ... [2025-03-03 16:59:19,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:59:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:59:19,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:59:19,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:59:20,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:59:20,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:59:20,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:59:20,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:59:20,077 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:59:20,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:59:20,351 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-03 16:59:20,351 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:59:20,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:59:20,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:59:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:20 BoogieIcfgContainer [2025-03-03 16:59:20,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:59:20,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:59:20,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:59:20,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:59:20,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:59:19" (1/3) ... [2025-03-03 16:59:20,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf2bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:59:20, skipping insertion in model container [2025-03-03 16:59:20,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:19" (2/3) ... [2025-03-03 16:59:20,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf2bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:59:20, skipping insertion in model container [2025-03-03 16:59:20,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:20" (3/3) ... [2025-03-03 16:59:20,380 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2025-03-03 16:59:20,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:59:20,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal181.c that has 1 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:59:20,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:59:20,442 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;@e06fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:59:20,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:59:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 16:59:20,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:20,450 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-03 16:59:20,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:20,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash -169576777, now seen corresponding path program 1 times [2025-03-03 16:59:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-03-03 16:59:20,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:20,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 16:59:20,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 16:59:20,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:20,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:59:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-03-03 16:59:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839612250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:59:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706416062] [2025-03-03 16:59:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:20,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:59:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:59:20,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:59:20,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:59:20,888 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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.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-03 16:59:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:20,947 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2025-03-03 16:59:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:59:20,950 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-03 16:59:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:20,954 INFO L225 Difference]: With dead ends: 89 [2025-03-03 16:59:20,954 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 16:59:20,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:59:20,959 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:59:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 16:59:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 16:59:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2025-03-03 16:59:20,980 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 23 [2025-03-03 16:59:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:20,980 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2025-03-03 16:59:20,980 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-03 16:59:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2025-03-03 16:59:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:59:20,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:20,981 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-03 16:59:20,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:59:20,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -957233632, now seen corresponding path program 1 times [2025-03-03 16:59:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-03-03 16:59:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:20,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:59:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:59:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:59:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958048392] [2025-03-03 16:59:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958048392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:21,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:21,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:59:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-03-03 16:59:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:21,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:59:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:59:21,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:59:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:59:21,115 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:21,165 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2025-03-03 16:59:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:59:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2025-03-03 16:59:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:21,166 INFO L225 Difference]: With dead ends: 90 [2025-03-03 16:59:21,167 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 16:59:21,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:59:21,168 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:21,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:59:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 16:59:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 16:59:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2025-03-03 16:59:21,174 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 24 [2025-03-03 16:59:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:21,175 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2025-03-03 16:59:21,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2025-03-03 16:59:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 16:59:21,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:21,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:59:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:59:21,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:21,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1972929582, now seen corresponding path program 1 times [2025-03-03 16:59:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-03 16:59:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:21,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 16:59:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 16:59:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:59:21,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-03 16:59:21,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951240409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:21,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:21,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:59:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398941588] [2025-03-03 16:59:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:21,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:59:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:59:21,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:59:21,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:59:21,434 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:21,523 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2025-03-03 16:59:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:59:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-03-03 16:59:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:21,524 INFO L225 Difference]: With dead ends: 121 [2025-03-03 16:59:21,524 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 16:59:21,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:59:21,525 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 141 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:21,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 213 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:59:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 16:59:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2025-03-03 16:59:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2025-03-03 16:59:21,529 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2025-03-03 16:59:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:21,529 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2025-03-03 16:59:21,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2025-03-03 16:59:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:59:21,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:21,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:59:21,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:59:21,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:21,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash 857087621, now seen corresponding path program 1 times [2025-03-03 16:59:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:21,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361227077] [2025-03-03 16:59:21,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:21,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:59:21,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:59:21,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:21,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:59:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361227077] [2025-03-03 16:59:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361227077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:59:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042274354] [2025-03-03 16:59:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:21,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:59:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:59:21,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:59:21,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:59:21,730 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:21,866 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2025-03-03 16:59:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:59:21,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 16:59:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:21,869 INFO L225 Difference]: With dead ends: 123 [2025-03-03 16:59:21,869 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 16:59:21,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:59:21,870 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 144 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:21,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 308 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:59:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 16:59:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2025-03-03 16:59:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2025-03-03 16:59:21,877 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 26 [2025-03-03 16:59:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:21,877 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2025-03-03 16:59:21,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2025-03-03 16:59:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 16:59:21,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:21,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:59:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:59:21,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -427611272, now seen corresponding path program 1 times [2025-03-03 16:59:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-03-03 16:59:21,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 16:59:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 16:59:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:59:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-03-03 16:59:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444907341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:59:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951632] [2025-03-03 16:59:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:22,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:59:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:59:22,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:59:22,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:59:22,210 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:22,385 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2025-03-03 16:59:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:59:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2025-03-03 16:59:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:22,386 INFO L225 Difference]: With dead ends: 123 [2025-03-03 16:59:22,387 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 16:59:22,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:59:22,388 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 294 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-03 16:59:22,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 294 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:59:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 16:59:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-03-03 16:59:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-03-03 16:59:22,406 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 27 [2025-03-03 16:59:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:22,406 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-03-03 16:59:22,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-03-03 16:59:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 16:59:22,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:22,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:59:22,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:59:22,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:22,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 815509118, now seen corresponding path program 1 times [2025-03-03 16:59:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:59:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-03-03 16:59:22,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:59:22,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:59:22,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:59:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:59:22,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 16:59:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:59:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:59:22,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:22,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 16:59:22,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 16:59:22,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 16:59:22,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 16:59:22,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:59:22,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 16:59:22,495 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 16:59:22,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:59:22,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:59:22 BoogieIcfgContainer [2025-03-03 16:59:22,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:59:22,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:59:22,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:59:22,506 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:59:22,507 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:20" (3/4) ... [2025-03-03 16:59:22,508 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 16:59:22,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:59:22,509 INFO L158 Benchmark]: Toolchain (without parser) took 2819.85ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 99.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.56ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 101.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.60ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 97.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: IcfgBuilder took 409.20ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 66.9MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: TraceAbstraction took 2130.64ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 99.5MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:22,511 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:22,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.56ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 101.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.60ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 97.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 409.20ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 66.9MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2130.64ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 99.5MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 27.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 bitwiseOr at line 79, overapproximation of bitwiseAnd at line 84. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_3 var_7 = 0; [L33] const SORT_1 var_11 = 0; [L34] const SORT_3 var_24 = 1; [L36] SORT_1 input_2; [L37] SORT_3 input_4; [L38] SORT_1 input_5; [L39] SORT_1 input_6; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L41] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L42] SORT_1 state_12 = __VERIFIER_nondet_uint() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L43] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L44] SORT_1 state_17 = __VERIFIER_nondet_uint() & mask_SORT_1; [L46] SORT_3 init_9_arg_1 = var_7; [L47] state_8 = init_9_arg_1 [L48] SORT_1 init_13_arg_1 = var_11; [L49] state_12 = init_13_arg_1 [L50] SORT_3 init_15_arg_1 = var_7; [L51] state_14 = init_15_arg_1 [L52] SORT_1 init_18_arg_1 = var_11; [L53] state_17 = init_18_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_11=0, var_24=1, var_7=0] [L56] input_2 = __VERIFIER_nondet_uint() [L57] input_4 = __VERIFIER_nondet_uchar() [L58] input_5 = __VERIFIER_nondet_uint() [L59] input_6 = __VERIFIER_nondet_uint() [L62] SORT_3 var_10_arg_0 = state_8; [L63] SORT_3 var_10 = ~var_10_arg_0; [L64] SORT_3 var_16_arg_0 = state_14; [L65] SORT_1 var_16_arg_1 = state_12; [L66] SORT_1 var_16_arg_2 = input_2; [L67] SORT_1 var_16 = var_16_arg_0 ? var_16_arg_1 : var_16_arg_2; VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L68] EXPR var_16 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_24=1, var_7=0] [L68] var_16 = var_16 & mask_SORT_1 [L69] SORT_3 var_19_arg_0 = state_14; [L70] SORT_1 var_19_arg_1 = state_17; [L71] SORT_1 var_19_arg_2 = input_2; [L72] SORT_1 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_19=0, var_24=1, var_7=0] [L73] EXPR var_19 & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L73] var_19 = var_19 & mask_SORT_1 [L74] SORT_1 var_20_arg_0 = var_16; [L75] SORT_1 var_20_arg_1 = var_19; [L76] SORT_3 var_20 = var_20_arg_0 == var_20_arg_1; [L77] SORT_3 var_21_arg_0 = var_10; [L78] SORT_3 var_21_arg_1 = var_20; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_7=0] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L79] SORT_3 var_21 = var_21_arg_0 | var_21_arg_1; [L80] SORT_3 var_25_arg_0 = var_21; [L81] SORT_3 var_25 = ~var_25_arg_0; [L82] SORT_3 var_26_arg_0 = var_24; [L83] SORT_3 var_26_arg_1 = var_25; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_7=0] [L84] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L84] SORT_3 var_26 = var_26_arg_0 & var_26_arg_1; [L85] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L85] var_26 = var_26 & mask_SORT_3 [L86] SORT_3 bad_27_arg_0 = var_26; [L87] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 1162 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 888 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 274 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 16:59:22,528 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.cal181.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 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:59:24,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:59:24,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 16:59:24,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:59:24,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:59:24,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:59:24,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:59:24,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:59:24,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:59:24,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:59:24,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:59:24,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:59:24,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:59:24,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:59:24,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:59:24,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:59:24,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:59:24,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:59:24,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:59:24,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:59:24,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:59:24,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:59:24,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:59:24,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:59:24,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:59:24,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:59:24,381 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 -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2025-03-03 16:59:24,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:59:24,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:59:24,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:59:24,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:59:24,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:59:24,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2025-03-03 16:59:25,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057c1d137/ad70447f1ee94f9ca1d9bf6933ef1e57/FLAGbc75e5697 [2025-03-03 16:59:26,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:59:26,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2025-03-03 16:59:26,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057c1d137/ad70447f1ee94f9ca1d9bf6933ef1e57/FLAGbc75e5697 [2025-03-03 16:59:26,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057c1d137/ad70447f1ee94f9ca1d9bf6933ef1e57 [2025-03-03 16:59:26,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:59:26,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:59:26,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:59:26,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:59:26,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:59:26,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef6367f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26, skipping insertion in model container [2025-03-03 16:59:26,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:59:26,514 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.cal181.c[1246,1259] [2025-03-03 16:59:26,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:59:26,552 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:59:26,559 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.cal181.c[1246,1259] [2025-03-03 16:59:26,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:59:26,582 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:59:26,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26 WrapperNode [2025-03-03 16:59:26,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:59:26,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:59:26,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:59:26,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:59:26,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,612 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-03-03 16:59:26,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:59:26,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:59:26,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:59:26,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:59:26,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,638 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:59:26,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:59:26,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:59:26,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:59:26,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:59:26,655 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (1/1) ... [2025-03-03 16:59:26,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:59:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:59:26,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:59:26,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:59:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:59:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 16:59:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:59:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:59:26,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:59:26,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:59:26,911 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-03 16:59:26,911 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:59:26,917 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:59:26,917 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:59:26,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:26 BoogieIcfgContainer [2025-03-03 16:59:26,917 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:59:26,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:59:26,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:59:26,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:59:26,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:59:26" (1/3) ... [2025-03-03 16:59:26,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eef5c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:59:26, skipping insertion in model container [2025-03-03 16:59:26,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:59:26" (2/3) ... [2025-03-03 16:59:26,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eef5c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:59:26, skipping insertion in model container [2025-03-03 16:59:26,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:26" (3/3) ... [2025-03-03 16:59:26,925 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2025-03-03 16:59:26,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:59:26,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal181.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:59:26,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:59:26,979 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;@74256ac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:59:26,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:59:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 16:59:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:26,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 16:59:26,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:26,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 16:59:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:59:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033990009] [2025-03-03 16:59:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:59:26,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:59:27,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:59:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 16:59:27,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 16:59:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:27,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:59:27,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:59:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:27,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:59:27,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:59:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033990009] [2025-03-03 16:59:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033990009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:59:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:59:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:59:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226388407] [2025-03-03 16:59:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:59:27,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:59:27,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:59:27,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:59:27,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:59:27,240 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:27,270 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 16:59:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:59:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 16:59:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:27,276 INFO L225 Difference]: With dead ends: 18 [2025-03-03 16:59:27,276 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 16:59:27,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:59:27,281 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:27,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:59:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 16:59:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 16:59:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 16:59:27,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 16:59:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:27,303 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 16:59:27,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 16:59:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 16:59:27,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:27,303 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 16:59:27,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:59:27,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:27,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:27,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 16:59:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:59:27,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1382302964] [2025-03-03 16:59:27,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:59:27,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:59:27,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:59:27,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:59:27,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 16:59:27,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 16:59:27,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:59:27,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:27,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 16:59:27,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:59:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:27,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:59:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:28,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:59:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382302964] [2025-03-03 16:59:28,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382302964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:59:28,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:59:28,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 16:59:28,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748275738] [2025-03-03 16:59:28,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 16:59:28,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:59:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:59:28,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:59:28,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:59:28,464 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:28,536 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 16:59:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:59:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 16:59:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:28,537 INFO L225 Difference]: With dead ends: 14 [2025-03-03 16:59:28,537 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 16:59:28,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:59:28,538 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:28,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:59:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 16:59:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 16:59:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 16:59:28,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 16:59:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:28,540 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 16:59:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 16:59:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 16:59:28,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:59:28,541 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 16:59:28,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 16:59:28,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:28,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:59:28,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:59:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 16:59:28,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 16:59:28,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507025060] [2025-03-03 16:59:28,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:59:28,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:59:28,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:59:28,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:59:28,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 16:59:28,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 16:59:28,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:59:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:59:28,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 16:59:28,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:59:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:28,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:59:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:59:30,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 16:59:30,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507025060] [2025-03-03 16:59:30,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507025060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:59:30,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:59:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 16:59:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352632346] [2025-03-03 16:59:30,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 16:59:30,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:59:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 16:59:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:59:30,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:59:30,990 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:59:31,063 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-03 16:59:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:59:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 16:59:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:59:31,064 INFO L225 Difference]: With dead ends: 12 [2025-03-03 16:59:31,064 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 16:59:31,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:59:31,065 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:59:31,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:59:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 16:59:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 16:59:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 16:59:31,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-03-03 16:59:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:59:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 16:59:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:59:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 16:59:31,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 16:59:31,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 16:59:31,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:59:31,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:59:31,275 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-03 16:59:31,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 16:59:31,336 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 16:59:31,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:59:31 BoogieIcfgContainer [2025-03-03 16:59:31,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 16:59:31,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 16:59:31,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 16:59:31,347 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 16:59:31,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:59:26" (3/4) ... [2025-03-03 16:59:31,350 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 16:59:31,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 16:59:31,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 16:59:31,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 16:59:31,359 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 16:59:31,410 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 16:59:31,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 16:59:31,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 16:59:31,412 INFO L158 Benchmark]: Toolchain (without parser) took 5023.62ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 90.5MB in the beginning and 163.7MB in the end (delta: -73.1MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2025-03-03 16:59:31,412 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.14ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 77.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.47ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: IcfgBuilder took 262.86ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: TraceAbstraction took 4427.56ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 57.4MB in the beginning and 168.8MB in the end (delta: -111.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-03-03 16:59:31,413 INFO L158 Benchmark]: Witness Printer took 63.54ms. Allocated memory is still 285.2MB. Free memory was 168.8MB in the beginning and 163.7MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 16:59:31,414 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.14ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.14ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 77.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.47ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.86ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.0MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4427.56ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 57.4MB in the beginning and 168.8MB in the end (delta: -111.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Witness Printer took 63.54ms. Allocated memory is still 285.2MB. Free memory was 168.8MB in the beginning and 163.7MB in the end (delta: 5.1MB). 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 11 QuantifiedInterpolants, 4720 SizeOfPredicates, 18 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Location Invariant Derived location invariant: (((((((((1 == mask_SORT_3) && (0 == ((1 + mask_SORT_1) % 4294967296))) && (0 == var_7)) && (1 == state_14)) && (1 == state_8)) && (state_17 == state_12)) && (1 == var_24)) || ((((((1 == mask_SORT_3) && (0 == ((1 + mask_SORT_1) % 4294967296))) && (0 == var_7)) && (0 == state_8)) && (0 == state_14)) && (1 == var_24))) || ((((((1 == mask_SORT_3) && (0 == ((1 + mask_SORT_1) % 4294967296))) && (0 == var_7)) && (1 == state_8)) && (0 == state_14)) && (1 == var_24))) RESULT: Ultimate proved your program to be correct! [2025-03-03 16:59:31,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE