./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:07:42,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:07:42,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:07:43,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:07:43,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:07:43,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:07:43,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:07:43,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:07:43,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:07:43,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:07:43,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:07:43,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:07:43,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:07:43,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:07:43,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:07:43,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:07:43,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:43,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:07:43,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:07:43,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:07:43,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:07:43,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:07:43,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:07:43,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:07:43,028 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2025-03-16 21:07:43,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:07:43,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:07:43,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:07:43,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:07:43,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:07:43,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-03-16 21:07:44,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2ff58c2/8aaadf542f1847f1b1be1233fc3b5eb9/FLAGd61696c47 [2025-03-16 21:07:44,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:07:44,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-03-16 21:07:44,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2ff58c2/8aaadf542f1847f1b1be1233fc3b5eb9/FLAGd61696c47 [2025-03-16 21:07:44,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2ff58c2/8aaadf542f1847f1b1be1233fc3b5eb9 [2025-03-16 21:07:44,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:07:44,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:07:44,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:44,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:07:44,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:07:44,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:44" (1/1) ... [2025-03-16 21:07:44,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:44, skipping insertion in model container [2025-03-16 21:07:44,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:44" (1/1) ... [2025-03-16 21:07:44,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:07:45,050 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.cal1.c[1244,1257] [2025-03-16 21:07:45,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:45,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:07:45,216 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.cal1.c[1244,1257] [2025-03-16 21:07:45,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:45,308 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:07:45,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45 WrapperNode [2025-03-16 21:07:45,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:45,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:45,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:07:45,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:07:45,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,450 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1797 [2025-03-16 21:07:45,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:45,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:07:45,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:07:45,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:07:45,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,547 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:07:45,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:07:45,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:07:45,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:07:45,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:07:45,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:45,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:45,658 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-16 21:07:45,661 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-16 21:07:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:07:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:07:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:07:45,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:07:45,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:07:45,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:07:45,875 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:07:47,084 INFO L? ?]: Removed 1025 outVars from TransFormulas that were not future-live. [2025-03-16 21:07:47,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:07:47,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:07:47,141 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:07:47,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:47 BoogieIcfgContainer [2025-03-16 21:07:47,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:07:47,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:07:47,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:07:47,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:07:47,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:07:44" (1/3) ... [2025-03-16 21:07:47,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a69b57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:47, skipping insertion in model container [2025-03-16 21:07:47,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45" (2/3) ... [2025-03-16 21:07:47,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a69b57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:47, skipping insertion in model container [2025-03-16 21:07:47,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:47" (3/3) ... [2025-03-16 21:07:47,149 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2025-03-16 21:07:47,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:07:47,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal1.c that has 1 procedures, 328 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:07:47,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:07:47,222 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;@2df605b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:07:47,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:07:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 328 states, 326 states have (on average 1.5) internal successors, (489), 327 states have internal predecessors, (489), 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-16 21:07:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 21:07:47,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:47,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:47,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:47,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash 269637700, now seen corresponding path program 1 times [2025-03-16 21:07:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957895339] [2025-03-16 21:07:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:47,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 21:07:47,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 21:07:47,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:47,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:47,934 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-16 21:07:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957895339] [2025-03-16 21:07:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957895339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:47,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978002510] [2025-03-16 21:07:47,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:47,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:47,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:47,959 INFO L87 Difference]: Start difference. First operand has 328 states, 326 states have (on average 1.5) internal successors, (489), 327 states have internal predecessors, (489), 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 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-16 21:07:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:48,183 INFO L93 Difference]: Finished difference Result 535 states and 799 transitions. [2025-03-16 21:07:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:48,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-16 21:07:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:48,193 INFO L225 Difference]: With dead ends: 535 [2025-03-16 21:07:48,193 INFO L226 Difference]: Without dead ends: 328 [2025-03-16 21:07:48,195 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-16 21:07:48,196 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:48,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1207 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:07:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-16 21:07:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-16 21:07:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.492354740061162) internal successors, (488), 327 states have internal predecessors, (488), 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-16 21:07:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 488 transitions. [2025-03-16 21:07:48,234 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 488 transitions. Word has length 78 [2025-03-16 21:07:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:48,234 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 488 transitions. [2025-03-16 21:07:48,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-16 21:07:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2025-03-16 21:07:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 21:07:48,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:48,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:07:48,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:48,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -226486448, now seen corresponding path program 1 times [2025-03-16 21:07:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743559239] [2025-03-16 21:07:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:48,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 21:07:48,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 21:07:48,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:48,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:48,437 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-16 21:07:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743559239] [2025-03-16 21:07:48,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743559239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:48,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:48,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627669241] [2025-03-16 21:07:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:48,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:48,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:48,440 INFO L87 Difference]: Start difference. First operand 328 states and 488 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-16 21:07:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:48,597 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2025-03-16 21:07:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:48,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-16 21:07:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:48,599 INFO L225 Difference]: With dead ends: 537 [2025-03-16 21:07:48,599 INFO L226 Difference]: Without dead ends: 330 [2025-03-16 21:07:48,599 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-16 21:07:48,600 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:48,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1204 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:07:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-16 21:07:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-16 21:07:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.4893617021276595) internal successors, (490), 329 states have internal predecessors, (490), 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-16 21:07:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 490 transitions. [2025-03-16 21:07:48,619 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 490 transitions. Word has length 79 [2025-03-16 21:07:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:48,619 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 490 transitions. [2025-03-16 21:07:48,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-16 21:07:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 490 transitions. [2025-03-16 21:07:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 21:07:48,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:48,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:48,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:07:48,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:48,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash -794603073, now seen corresponding path program 1 times [2025-03-16 21:07:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756023815] [2025-03-16 21:07:48,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:48,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:48,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 21:07:48,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 21:07:48,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:48,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:49,097 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-16 21:07:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:49,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756023815] [2025-03-16 21:07:49,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756023815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:49,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:49,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:07:49,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195119378] [2025-03-16 21:07:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:49,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:07:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:49,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:07:49,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:07:49,099 INFO L87 Difference]: Start difference. First operand 330 states and 490 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-16 21:07:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:49,382 INFO L93 Difference]: Finished difference Result 576 states and 850 transitions. [2025-03-16 21:07:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:07:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-03-16 21:07:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:49,384 INFO L225 Difference]: With dead ends: 576 [2025-03-16 21:07:49,384 INFO L226 Difference]: Without dead ends: 367 [2025-03-16 21:07:49,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:07:49,385 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 523 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:49,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1568 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:07:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-16 21:07:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 348. [2025-03-16 21:07:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4870317002881845) internal successors, (516), 347 states have internal predecessors, (516), 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-16 21:07:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 516 transitions. [2025-03-16 21:07:49,396 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 516 transitions. Word has length 80 [2025-03-16 21:07:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 516 transitions. [2025-03-16 21:07:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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-16 21:07:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 516 transitions. [2025-03-16 21:07:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 21:07:49,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:49,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:07:49,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1269495979, now seen corresponding path program 1 times [2025-03-16 21:07:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807731509] [2025-03-16 21:07:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:49,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 21:07:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 21:07:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:49,714 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-16 21:07:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807731509] [2025-03-16 21:07:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807731509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:07:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231472830] [2025-03-16 21:07:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:49,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:07:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:49,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:07:49,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:07:49,715 INFO L87 Difference]: Start difference. First operand 348 states and 516 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-16 21:07:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:50,089 INFO L93 Difference]: Finished difference Result 578 states and 852 transitions. [2025-03-16 21:07:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:07:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2025-03-16 21:07:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:50,090 INFO L225 Difference]: With dead ends: 578 [2025-03-16 21:07:50,090 INFO L226 Difference]: Without dead ends: 369 [2025-03-16 21:07:50,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:07:50,091 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 526 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:50,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2341 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:07:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-16 21:07:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2025-03-16 21:07:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 350 states have internal predecessors, (520), 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-16 21:07:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 520 transitions. [2025-03-16 21:07:50,102 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 520 transitions. Word has length 81 [2025-03-16 21:07:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 520 transitions. [2025-03-16 21:07:50,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-16 21:07:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 520 transitions. [2025-03-16 21:07:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 21:07:50,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:50,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:50,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:07:50,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -695042875, now seen corresponding path program 1 times [2025-03-16 21:07:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317598608] [2025-03-16 21:07:50,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:50,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 21:07:50,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 21:07:50,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:50,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:50,647 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-16 21:07:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:50,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317598608] [2025-03-16 21:07:50,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317598608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:50,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:50,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:07:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315368680] [2025-03-16 21:07:50,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:50,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:07:50,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:50,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:07:50,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:07:50,648 INFO L87 Difference]: Start difference. First operand 351 states and 520 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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-16 21:07:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:51,072 INFO L93 Difference]: Finished difference Result 578 states and 851 transitions. [2025-03-16 21:07:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:07:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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 82 [2025-03-16 21:07:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:51,074 INFO L225 Difference]: With dead ends: 578 [2025-03-16 21:07:51,074 INFO L226 Difference]: Without dead ends: 369 [2025-03-16 21:07:51,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:07:51,076 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 521 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:51,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2327 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:07:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-16 21:07:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 355. [2025-03-16 21:07:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 354 states have internal predecessors, (525), 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-16 21:07:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2025-03-16 21:07:51,086 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 82 [2025-03-16 21:07:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:51,086 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2025-03-16 21:07:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 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-16 21:07:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2025-03-16 21:07:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 21:07:51,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:51,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:07:51,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:07:51,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:51,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 80338487, now seen corresponding path program 1 times [2025-03-16 21:07:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227610976] [2025-03-16 21:07:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:51,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 21:07:51,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 21:07:51,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:07:51,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:07:51,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 21:07:51,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 21:07:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:07:51,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:07:51,197 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:07:51,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:07:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:07:51,201 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-16 21:07:51,250 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:07:51,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:07:51,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:07:51 BoogieIcfgContainer [2025-03-16 21:07:51,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:07:51,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:07:51,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:07:51,269 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:07:51,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:47" (3/4) ... [2025-03-16 21:07:51,271 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:07:51,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:07:51,274 INFO L158 Benchmark]: Toolchain (without parser) took 6363.95ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.6MB in the beginning and 173.4MB in the end (delta: -66.8MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,274 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:07:51,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.73ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 69.8MB in the end (delta: 36.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.14ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 41.4MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,274 INFO L158 Benchmark]: Boogie Preprocessor took 178.25ms. Allocated memory is still 142.6MB. Free memory was 41.4MB in the beginning and 81.2MB in the end (delta: -39.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,275 INFO L158 Benchmark]: IcfgBuilder took 1511.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.2MB in the beginning and 175.3MB in the end (delta: -94.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,275 INFO L158 Benchmark]: TraceAbstraction took 4124.43ms. Allocated memory was 285.2MB in the beginning and 343.9MB in the end (delta: 58.7MB). Free memory was 174.5MB in the beginning and 173.5MB in the end (delta: 1.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2025-03-16 21:07:51,275 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 343.9MB. Free memory was 173.5MB in the beginning and 173.4MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:07:51,276 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.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.73ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 69.8MB in the end (delta: 36.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.14ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 41.4MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.25ms. Allocated memory is still 142.6MB. Free memory was 41.4MB in the beginning and 81.2MB in the end (delta: -39.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1511.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 81.2MB in the beginning and 175.3MB in the end (delta: -94.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4124.43ms. Allocated memory was 285.2MB in the beginning and 343.9MB in the end (delta: 58.7MB). Free memory was 174.5MB in the beginning and 173.5MB in the end (delta: 1.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 343.9MB. Free memory was 173.5MB in the beginning and 173.4MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 261, overapproximation of bitwiseAnd at line 266. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_56 = 0; [L39] const SORT_6 var_60 = 0; [L40] const SORT_1 var_73 = 1; [L41] const SORT_14 var_77 = 0; [L42] const SORT_10 var_98 = 0; [L44] SORT_1 input_2; [L45] SORT_1 input_3; [L46] SORT_1 input_4; [L47] SORT_1 input_5; [L48] SORT_6 input_7; [L49] SORT_6 input_8; [L50] SORT_1 input_9; [L51] SORT_10 input_11; [L52] SORT_1 input_12; [L53] SORT_1 input_13; [L54] SORT_14 input_15; [L55] SORT_10 input_16; [L56] SORT_1 input_17; [L57] SORT_6 input_18; [L58] SORT_1 input_19; [L59] SORT_10 input_20; [L60] SORT_10 input_21; [L61] SORT_6 input_22; [L62] SORT_6 input_23; [L63] SORT_1 input_24; [L64] SORT_14 input_25; [L65] SORT_10 input_26; [L66] SORT_1 input_27; [L67] SORT_6 input_28; [L68] SORT_6 input_29; [L69] SORT_6 input_30; [L70] SORT_6 input_31; [L71] SORT_10 input_32; [L72] SORT_10 input_33; [L73] SORT_10 input_34; [L74] SORT_10 input_35; [L75] SORT_10 input_36; [L76] SORT_10 input_37; [L77] SORT_10 input_38; [L78] SORT_10 input_39; [L79] SORT_1 input_40; [L80] SORT_1 input_41; [L81] SORT_1 input_42; [L82] SORT_1 input_43; [L83] SORT_1 input_44; [L84] SORT_1 input_45; [L85] SORT_14 input_46; [L86] SORT_14 input_47; [L87] SORT_14 input_48; [L88] SORT_14 input_49; [L89] SORT_6 input_50; [L90] SORT_6 input_51; [L91] SORT_1 input_52; [L92] SORT_1 input_53; [L93] SORT_1 input_54; [L94] SORT_1 input_55; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L96] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L97] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L98] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L99] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L100] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L100] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L101] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L101] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L102] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L103] SORT_1 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L104] SORT_1 state_93 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L105] SORT_10 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L106] SORT_10 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L107] SORT_1 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L108] SORT_1 state_123 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L109] SORT_10 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L110] SORT_10 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L111] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L111] SORT_6 state_148 = __VERIFIER_nondet_uint() & mask_SORT_6; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L112] SORT_6 state_156 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L113] SORT_14 state_170 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L114] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L114] SORT_14 state_173 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L115] SORT_1 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L116] SORT_10 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L117] SORT_1 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L118] SORT_1 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L119] SORT_10 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L120] SORT_1 state_212 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L121] SORT_10 state_217 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L122] SORT_1 state_223 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L123] SORT_10 state_238 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L124] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L124] SORT_6 state_249 = __VERIFIER_nondet_uint() & mask_SORT_6; [L125] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L125] SORT_6 state_282 = __VERIFIER_nondet_uint() & mask_SORT_6; [L127] SORT_1 init_58_arg_1 = var_56; [L128] state_57 = init_58_arg_1 [L129] SORT_6 init_62_arg_1 = var_60; [L130] state_61 = init_62_arg_1 [L131] SORT_1 init_64_arg_1 = var_56; [L132] state_63 = init_64_arg_1 [L133] SORT_6 init_67_arg_1 = var_60; [L134] state_66 = init_67_arg_1 [L135] SORT_14 init_79_arg_1 = var_77; [L136] state_78 = init_79_arg_1 [L137] SORT_14 init_82_arg_1 = var_77; [L138] state_81 = init_82_arg_1 [L139] SORT_1 init_85_arg_1 = var_56; [L140] state_84 = init_85_arg_1 [L141] SORT_1 init_91_arg_1 = var_56; [L142] state_90 = init_91_arg_1 [L143] SORT_1 init_94_arg_1 = var_56; [L144] state_93 = init_94_arg_1 [L145] SORT_10 init_100_arg_1 = var_98; [L146] state_99 = init_100_arg_1 [L147] SORT_10 init_103_arg_1 = var_98; [L148] state_102 = init_103_arg_1 [L149] SORT_1 init_117_arg_1 = var_56; [L150] state_116 = init_117_arg_1 [L151] SORT_1 init_124_arg_1 = var_56; [L152] state_123 = init_124_arg_1 [L153] SORT_10 init_136_arg_1 = var_98; [L154] state_135 = init_136_arg_1 [L155] SORT_10 init_139_arg_1 = var_98; [L156] state_138 = init_139_arg_1 [L157] SORT_6 init_149_arg_1 = var_60; [L158] state_148 = init_149_arg_1 [L159] SORT_6 init_157_arg_1 = var_60; [L160] state_156 = init_157_arg_1 [L161] SORT_14 init_171_arg_1 = var_77; [L162] state_170 = init_171_arg_1 [L163] SORT_14 init_174_arg_1 = var_77; [L164] state_173 = init_174_arg_1 [L165] SORT_1 init_177_arg_1 = var_56; [L166] state_176 = init_177_arg_1 [L167] SORT_10 init_180_arg_1 = var_98; [L168] state_179 = init_180_arg_1 [L169] SORT_1 init_185_arg_1 = var_56; [L170] state_184 = init_185_arg_1 [L171] SORT_1 init_192_arg_1 = var_56; [L172] state_191 = init_192_arg_1 [L173] SORT_10 init_197_arg_1 = var_98; [L174] state_196 = init_197_arg_1 [L175] SORT_1 init_213_arg_1 = var_56; [L176] state_212 = init_213_arg_1 [L177] SORT_10 init_218_arg_1 = var_98; [L178] state_217 = init_218_arg_1 [L179] SORT_1 init_224_arg_1 = var_56; [L180] state_223 = init_224_arg_1 [L181] SORT_10 init_239_arg_1 = var_98; [L182] state_238 = init_239_arg_1 [L183] SORT_6 init_250_arg_1 = var_60; [L184] state_249 = init_250_arg_1 [L185] SORT_6 init_283_arg_1 = var_60; [L186] state_282 = init_283_arg_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L189] input_2 = __VERIFIER_nondet_uchar() [L190] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L190] input_2 = input_2 & mask_SORT_1 [L191] input_3 = __VERIFIER_nondet_uchar() [L192] input_4 = __VERIFIER_nondet_uchar() [L193] input_5 = __VERIFIER_nondet_uchar() [L194] input_7 = __VERIFIER_nondet_uint() [L195] input_8 = __VERIFIER_nondet_uint() [L196] input_9 = __VERIFIER_nondet_uchar() [L197] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L197] input_9 = input_9 & mask_SORT_1 [L198] input_11 = __VERIFIER_nondet_uchar() [L199] input_12 = __VERIFIER_nondet_uchar() [L200] input_13 = __VERIFIER_nondet_uchar() [L201] input_15 = __VERIFIER_nondet_ulong() [L202] input_16 = __VERIFIER_nondet_uchar() [L203] input_17 = __VERIFIER_nondet_uchar() [L204] input_18 = __VERIFIER_nondet_uint() [L205] input_19 = __VERIFIER_nondet_uchar() [L206] input_20 = __VERIFIER_nondet_uchar() [L207] input_21 = __VERIFIER_nondet_uchar() [L208] input_22 = __VERIFIER_nondet_uint() [L209] input_23 = __VERIFIER_nondet_uint() [L210] input_24 = __VERIFIER_nondet_uchar() [L211] input_25 = __VERIFIER_nondet_ulong() [L212] input_26 = __VERIFIER_nondet_uchar() [L213] input_27 = __VERIFIER_nondet_uchar() [L214] input_28 = __VERIFIER_nondet_uint() [L215] input_29 = __VERIFIER_nondet_uint() [L216] input_30 = __VERIFIER_nondet_uint() [L217] input_31 = __VERIFIER_nondet_uint() [L218] input_32 = __VERIFIER_nondet_uchar() [L219] input_33 = __VERIFIER_nondet_uchar() [L220] input_34 = __VERIFIER_nondet_uchar() [L221] input_35 = __VERIFIER_nondet_uchar() [L222] input_36 = __VERIFIER_nondet_uchar() [L223] input_37 = __VERIFIER_nondet_uchar() [L224] input_38 = __VERIFIER_nondet_uchar() [L225] input_39 = __VERIFIER_nondet_uchar() [L226] input_40 = __VERIFIER_nondet_uchar() [L227] input_41 = __VERIFIER_nondet_uchar() [L228] input_42 = __VERIFIER_nondet_uchar() [L229] input_43 = __VERIFIER_nondet_uchar() [L230] input_44 = __VERIFIER_nondet_uchar() [L231] input_45 = __VERIFIER_nondet_uchar() [L232] input_46 = __VERIFIER_nondet_ulong() [L233] input_47 = __VERIFIER_nondet_ulong() [L234] input_48 = __VERIFIER_nondet_ulong() [L235] input_49 = __VERIFIER_nondet_ulong() [L236] input_50 = __VERIFIER_nondet_uint() [L237] input_51 = __VERIFIER_nondet_uint() [L238] input_52 = __VERIFIER_nondet_uchar() [L239] input_53 = __VERIFIER_nondet_uchar() [L240] input_54 = __VERIFIER_nondet_uchar() [L241] input_55 = __VERIFIER_nondet_uchar() [L244] SORT_1 var_59_arg_0 = state_57; [L245] SORT_1 var_59 = ~var_59_arg_0; [L246] SORT_1 var_65_arg_0 = state_63; [L247] SORT_6 var_65_arg_1 = state_61; [L248] SORT_6 var_65_arg_2 = input_18; [L249] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L250] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0, var_98=0] [L250] var_65 = var_65 & mask_SORT_6 [L251] SORT_1 var_68_arg_0 = state_63; [L252] SORT_6 var_68_arg_1 = state_66; [L253] SORT_6 var_68_arg_2 = input_18; [L254] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0, var_98=0] [L255] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L255] var_68 = var_68 & mask_SORT_6 [L256] SORT_6 var_69_arg_0 = var_65; [L257] SORT_6 var_69_arg_1 = var_68; [L258] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L259] SORT_1 var_70_arg_0 = var_59; [L260] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0, var_98=0] [L261] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L261] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L262] SORT_1 var_74_arg_0 = var_70; [L263] SORT_1 var_74 = ~var_74_arg_0; [L264] SORT_1 var_75_arg_0 = var_73; [L265] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0, var_98=0] [L266] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L266] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L267] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L267] var_75 = var_75 & mask_SORT_1 [L268] SORT_1 bad_76_arg_0 = var_75; [L269] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 328 locations, 489 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1570 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1570 mSDsluCounter, 8647 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6668 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2041 IncrementalHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1979 mSDtfsCounter, 2041 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 21:07:51,300 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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:07:53,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:07:53,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:07:53,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:07:53,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:07:53,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:07:53,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:07:53,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:07:53,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:07:53,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:07:53,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:07:53,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:07:53,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:07:53,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:07:53,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:07:53,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:07:53,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:07:53,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:07:53,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:07:53,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:07:53,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:07:53,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:07:53,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:53,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:07:53,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:07:53,245 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2025-03-16 21:07:53,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:07:53,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:07:53,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:07:53,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:07:53,513 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:07:53,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-03-16 21:07:54,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccedb7147/97bf620cc623483db9560363232a9dc2/FLAGf626e5e83 [2025-03-16 21:07:54,909 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:07:54,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2025-03-16 21:07:54,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccedb7147/97bf620cc623483db9560363232a9dc2/FLAGf626e5e83 [2025-03-16 21:07:55,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccedb7147/97bf620cc623483db9560363232a9dc2 [2025-03-16 21:07:55,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:07:55,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:07:55,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:55,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:07:55,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:07:55,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e09995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55, skipping insertion in model container [2025-03-16 21:07:55,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:07:55,371 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.cal1.c[1244,1257] [2025-03-16 21:07:55,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:55,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:07:55,531 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.cal1.c[1244,1257] [2025-03-16 21:07:55,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:55,611 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:07:55,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55 WrapperNode [2025-03-16 21:07:55,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:55,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:55,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:07:55,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:07:55,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,672 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1157 [2025-03-16 21:07:55,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:55,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:07:55,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:07:55,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:07:55,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,714 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:07:55,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:07:55,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:07:55,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:07:55,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:07:55,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (1/1) ... [2025-03-16 21:07:55,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:55,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:55,791 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-16 21:07:55,794 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-16 21:07:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:07:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:07:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 21:07:55,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:07:55,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:07:56,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:07:56,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:07:56,777 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-16 21:07:56,777 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:07:56,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:07:56,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:07:56,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:56 BoogieIcfgContainer [2025-03-16 21:07:56,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:07:56,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:07:56,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:07:56,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:07:56,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:07:55" (1/3) ... [2025-03-16 21:07:56,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26472e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:56, skipping insertion in model container [2025-03-16 21:07:56,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:55" (2/3) ... [2025-03-16 21:07:56,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26472e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:56, skipping insertion in model container [2025-03-16 21:07:56,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:56" (3/3) ... [2025-03-16 21:07:56,792 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2025-03-16 21:07:56,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:07:56,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:07:56,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:07:56,845 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;@717711f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:07:56,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:07:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-16 21:07:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:07:56,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:56,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:07:56,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:07:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:07:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209225070] [2025-03-16 21:07:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:07:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:56,884 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-16 21:07:56,886 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-16 21:07:57,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:07:57,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:07:57,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:57,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:57,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 21:07:57,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:07:57,217 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-16 21:07:57,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:07:57,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:07:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209225070] [2025-03-16 21:07:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209225070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:07:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990973939] [2025-03-16 21:07:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:07:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:57,237 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:07:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:57,393 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:07:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:57,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 21:07:57,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:57,399 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:07:57,399 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:07:57,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 21:07:57,404 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:57,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:07:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:07:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:07:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 21:07:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:07:57,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:07:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:57,425 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:07:57,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:07:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:07:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:07:57,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:57,426 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:07:57,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 21:07:57,626 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-16 21:07:57,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:57,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:07:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:07:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124193883] [2025-03-16 21:07:57,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:07:57,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:57,630 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-16 21:07:57,631 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-16 21:07:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:07:57,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:07:57,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:57,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:57,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 21:07:57,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:07:58,185 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-16 21:07:58,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:07:58,873 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-16 21:07:58,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:07:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124193883] [2025-03-16 21:07:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124193883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:07:58,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:07:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:07:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420478078] [2025-03-16 21:07:58,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:07:58,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:07:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:07:58,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:07:58,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:07:58,876 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-16 21:07:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:59,247 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 21:07:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:07:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 7 [2025-03-16 21:07:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:59,248 INFO L225 Difference]: With dead ends: 14 [2025-03-16 21:07:59,248 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 21:07:59,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:07:59,248 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:59,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:07:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 21:07:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 21:07:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-16 21:07:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 21:07:59,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 21:07:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:59,251 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 21:07:59,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-16 21:07:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 21:07:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 21:07:59,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:59,252 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 21:07:59,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:07:59,452 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-16 21:07:59,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 21:07:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:07:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371643292] [2025-03-16 21:07:59,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:07:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:07:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:59,456 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-16 21:07:59,457 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-16 21:07:59,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 21:07:59,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 21:07:59,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:07:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:59,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 21:07:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates...