./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.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.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:25:19,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:25:19,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:25:19,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:25:19,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:25:19,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:25:19,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:25:19,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:25:19,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:25:19,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:25:19,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:25:19,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:25:19,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:25:19,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:25:19,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:25:19,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:25:19,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:25:19,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:25:19,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:25:19,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:25:19,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:25:19,779 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2025-03-03 17:25:19,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:25:19,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:25:19,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:25:19,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:25:19,990 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:25:19,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:21,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57994bae2/17146cf07e1c4855a281d507511274e0/FLAG0342269b2 [2025-03-03 17:25:21,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:25:21,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:21,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57994bae2/17146cf07e1c4855a281d507511274e0/FLAG0342269b2 [2025-03-03 17:25:21,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57994bae2/17146cf07e1c4855a281d507511274e0 [2025-03-03 17:25:21,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:25:21,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:25:21,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:25:21,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:25:21,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:25:21,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21, skipping insertion in model container [2025-03-03 17:25:21,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:25:21,478 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.eq_sdp_v1.c[1249,1262] [2025-03-03 17:25:21,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:25:21,539 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:25:21,546 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.eq_sdp_v1.c[1249,1262] [2025-03-03 17:25:21,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:25:21,591 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:25:21,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21 WrapperNode [2025-03-03 17:25:21,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:25:21,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:25:21,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:25:21,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:25:21,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,650 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 417 [2025-03-03 17:25:21,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:25:21,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:25:21,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:25:21,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:25:21,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,695 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 17:25:21,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:25:21,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:25:21,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:25:21,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:25:21,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (1/1) ... [2025-03-03 17:25:21,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:25:21,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:25:21,764 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 17:25:21,766 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 17:25:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:25:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:25:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:25:21,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:25:21,869 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:25:21,870 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:25:22,438 INFO L? ?]: Removed 169 outVars from TransFormulas that were not future-live. [2025-03-03 17:25:22,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:25:22,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:25:22,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:25:22,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:25:22 BoogieIcfgContainer [2025-03-03 17:25:22,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:25:22,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:25:22,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:25:22,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:25:22,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:25:21" (1/3) ... [2025-03-03 17:25:22,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a795f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:25:22, skipping insertion in model container [2025-03-03 17:25:22,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:21" (2/3) ... [2025-03-03 17:25:22,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a795f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:25:22, skipping insertion in model container [2025-03-03 17:25:22,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:25:22" (3/3) ... [2025-03-03 17:25:22,481 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:22,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:25:22,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v1.c that has 1 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:25:22,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:25:22,547 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;@32f75220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:25:22,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:25:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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 17:25:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:25:22,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:22,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:25:22,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1388881139, now seen corresponding path program 1 times [2025-03-03 17:25:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:25:22,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77138581] [2025-03-03 17:25:22,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:25:22,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:25:22,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:25:22,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:22,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:23,058 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 17:25:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:25:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77138581] [2025-03-03 17:25:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77138581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:25:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:25:23,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:25:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717966476] [2025-03-03 17:25:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:25:23,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:25:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:25:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:25:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:25:23,080 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 17:25:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:25:23,172 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2025-03-03 17:25:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:25:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-03-03 17:25:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:25:23,178 INFO L225 Difference]: With dead ends: 137 [2025-03-03 17:25:23,178 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 17:25:23,180 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 17:25:23,181 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:25:23,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:25:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 17:25:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 17:25:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 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 17:25:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-03 17:25:23,205 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 39 [2025-03-03 17:25:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:25:23,205 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-03 17:25:23,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 17:25:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-03 17:25:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:25:23,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:23,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:25:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:25:23,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -100963176, now seen corresponding path program 1 times [2025-03-03 17:25:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:25:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28441342] [2025-03-03 17:25:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:25:23,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:25:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:25:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:23,386 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 17:25:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:25:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28441342] [2025-03-03 17:25:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28441342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:25:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:25:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:25:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233347279] [2025-03-03 17:25:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:25:23,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:25:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:25:23,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:25:23,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:25:23,389 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 17:25:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:25:23,462 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2025-03-03 17:25:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:25:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-03-03 17:25:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:25:23,463 INFO L225 Difference]: With dead ends: 138 [2025-03-03 17:25:23,463 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 17:25:23,463 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 17:25:23,465 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:25:23,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:25:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 17:25:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-03 17:25:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 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 17:25:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-03 17:25:23,474 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 40 [2025-03-03 17:25:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:25:23,475 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-03 17:25:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 17:25:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-03 17:25:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 17:25:23,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:23,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:25:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:25:23,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:23,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1198349208, now seen corresponding path program 1 times [2025-03-03 17:25:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:25:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756127006] [2025-03-03 17:25:23,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:25:23,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 17:25:23,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 17:25:23,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:23,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:23,702 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 17:25:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:25:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756127006] [2025-03-03 17:25:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756127006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:25:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:25:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:25:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700672016] [2025-03-03 17:25:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:25:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:25:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:25:23,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:25:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:25:23,704 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:25:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:25:23,773 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2025-03-03 17:25:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:25:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 17:25:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:25:23,775 INFO L225 Difference]: With dead ends: 138 [2025-03-03 17:25:23,776 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 17:25:23,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:25:23,776 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 100 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:25:23,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 209 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:25:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 17:25:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 17:25:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 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 17:25:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-03 17:25:23,782 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 41 [2025-03-03 17:25:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:25:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-03 17:25:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:25:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-03 17:25:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:25:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:23,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:25:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:25:23,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash -177019314, now seen corresponding path program 1 times [2025-03-03 17:25:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:25:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599799696] [2025-03-03 17:25:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:25:23,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:25:23,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:25:23,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:23,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:25:23,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:25:23,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:25:23,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:25:23,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:23,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:25:23,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:25:23,909 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:25:23,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:25:23,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:25:23,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 17:25:23,933 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:25:23,942 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:25:23,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:25:23 BoogieIcfgContainer [2025-03-03 17:25:23,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:25:23,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:25:23,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:25:23,947 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:25:23,948 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:25:22" (3/4) ... [2025-03-03 17:25:23,950 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:25:23,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:25:23,951 INFO L158 Benchmark]: Toolchain (without parser) took 2582.77ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.2MB in the beginning and 252.5MB in the end (delta: -141.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,951 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:25:23,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.00ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 95.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.39ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 86.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,952 INFO L158 Benchmark]: Boogie Preprocessor took 86.30ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,952 INFO L158 Benchmark]: IcfgBuilder took 735.47ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 92.3MB in the end (delta: -10.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,952 INFO L158 Benchmark]: TraceAbstraction took 1471.54ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 91.9MB in the beginning and 253.7MB in the end (delta: -161.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2025-03-03 17:25:23,952 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 293.6MB. Free memory was 253.7MB in the beginning and 252.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:25:23,953 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.00ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 95.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.39ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 86.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.30ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 735.47ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 92.3MB in the end (delta: -10.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1471.54ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 91.9MB in the beginning and 253.7MB in the end (delta: -161.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 293.6MB. Free memory was 253.7MB in the beginning and 252.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 856 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 531 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 325 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:25:23,965 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.eq_sdp_v1.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 caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:25:25,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:25:25,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:25:25,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:25:25,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:25:25,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:25:25,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:25:25,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:25:25,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:25:25,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:25:25,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:25:25,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:25:25,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:25:25,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:25:25,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:25:25,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:25:25,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:25:25,873 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 -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2025-03-03 17:25:26,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:25:26,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:25:26,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:25:26,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:25:26,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:25:26,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:27,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6438b2c/3bb9b9c4720447169296753cce58ca12/FLAG6b5299f3c [2025-03-03 17:25:27,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:25:27,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:27,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6438b2c/3bb9b9c4720447169296753cce58ca12/FLAG6b5299f3c [2025-03-03 17:25:27,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6438b2c/3bb9b9c4720447169296753cce58ca12 [2025-03-03 17:25:27,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:25:27,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:25:27,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:25:27,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:25:27,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:25:27,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:25:27" (1/1) ... [2025-03-03 17:25:27,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffa73ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:27, skipping insertion in model container [2025-03-03 17:25:27,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:25:27" (1/1) ... [2025-03-03 17:25:27,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:25:28,020 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.eq_sdp_v1.c[1249,1262] [2025-03-03 17:25:28,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:25:28,082 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:25:28,093 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.eq_sdp_v1.c[1249,1262] [2025-03-03 17:25:28,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:25:28,153 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:25:28,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28 WrapperNode [2025-03-03 17:25:28,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:25:28,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:25:28,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:25:28,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:25:28,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,197 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 249 [2025-03-03 17:25:28,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:25:28,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:25:28,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:25:28,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:25:28,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,225 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 17:25:28,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:25:28,241 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:25:28,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:25:28,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:25:28,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (1/1) ... [2025-03-03 17:25:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:25:28,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:25:28,267 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 17:25:28,269 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 17:25:28,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:25:28,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:25:28,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:25:28,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:25:28,364 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:25:28,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:25:28,592 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-03 17:25:28,592 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:25:28,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:25:28,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:25:28,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:25:28 BoogieIcfgContainer [2025-03-03 17:25:28,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:25:28,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:25:28,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:25:28,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:25:28,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:25:27" (1/3) ... [2025-03-03 17:25:28,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7c3b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:25:28, skipping insertion in model container [2025-03-03 17:25:28,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:25:28" (2/3) ... [2025-03-03 17:25:28,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7c3b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:25:28, skipping insertion in model container [2025-03-03 17:25:28,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:25:28" (3/3) ... [2025-03-03 17:25:28,608 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2025-03-03 17:25:28,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:25:28,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:25:28,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:25:28,660 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;@21887352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:25:28,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:25:28,664 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 17:25:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:25:28,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:28,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:25:28,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:25:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:25:28,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229039042] [2025-03-03 17:25:28,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:28,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:25:28,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:25:28,680 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 17:25:28,681 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 17:25:28,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:25:28,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:25:28,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:28,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:28,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:25:28,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:25:28,899 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 17:25:28,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:25:28,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:25:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229039042] [2025-03-03 17:25:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229039042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:25:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:25:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:25:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166305826] [2025-03-03 17:25:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:25:28,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:25:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:25:28,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:25:28,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:25:28,918 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 17:25:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:25:28,938 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:25:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:25:28,940 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 17:25:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:25:28,945 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:25:28,945 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:25:28,947 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 17:25:28,949 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:25:28,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:25:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:25:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:25:28,963 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 17:25:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:25:28,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:25:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:25:28,966 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:25:28,966 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 17:25:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:25:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:25:28,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:28,967 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:25:28,974 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 17:25:29,168 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 17:25:29,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:25:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:25:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76179958] [2025-03-03 17:25:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:25:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:25:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:25:29,173 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 17:25:29,173 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 17:25:29,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:25:29,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:25:29,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:25:29,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:29,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 17:25:29,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:25:29,544 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 17:25:29,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:25:33,309 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 17:25:33,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:25:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76179958] [2025-03-03 17:25:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76179958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:25:33,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:25:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:25:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139838640] [2025-03-03 17:25:33,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:25:33,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:25:33,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:25:33,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:25:33,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:25:33,313 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 17:25:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:25:33,769 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 17:25:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:25:33,770 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 17:25:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:25:33,770 INFO L225 Difference]: With dead ends: 14 [2025-03-03 17:25:33,770 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 17:25:33,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:25:33,771 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:25:33,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:25:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 17:25:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 17:25:33,773 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 17:25:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:25:33,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:25:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:25:33,773 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:25:33,773 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 17:25:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:25:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:25:33,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:25:33,773 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:25:33,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:25:33,978 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 17:25:33,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:25:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:25:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:25:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:25:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530717606] [2025-03-03 17:25:33,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:25:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:25:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:25:33,981 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 17:25:33,982 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 17:25:34,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:25:34,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:25:34,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:25:34,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:25:34,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 17:25:34,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:25:35,718 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 17:25:35,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:25:49,797 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-03 17:25:49,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:25:49,798 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 101 [2025-03-03 17:25:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530717606] [2025-03-03 17:25:49,799 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 17:25:49,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 17:25:49,999 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 17:25:50,000 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-03 17:25:50,004 INFO L158 Benchmark]: Toolchain (without parser) took 22113.21ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.4MB in the beginning and 53.5MB in the end (delta: 38.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2025-03-03 17:25:50,005 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:25:50,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.35ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 76.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:25:50,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.99ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:25:50,005 INFO L158 Benchmark]: Boogie Preprocessor took 42.29ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 72.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:25:50,005 INFO L158 Benchmark]: IcfgBuilder took 358.53ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 47.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 17:25:50,006 INFO L158 Benchmark]: TraceAbstraction took 21402.11ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 53.5MB in the end (delta: -6.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2025-03-03 17:25:50,007 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.27ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.35ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 76.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.99ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 74.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.29ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 72.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.53ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 47.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21402.11ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 53.5MB in the end (delta: -6.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")