./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.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 f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:36:48,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:36:48,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:36:48,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:36:48,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:36:48,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:36:48,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:36:48,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:36:48,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:36:48,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:36:48,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:36:48,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:36:48,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:36:48,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:36:48,210 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:36:48,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:36:48,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:36:48,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:48,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:36:48,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:36:48,212 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 -> f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f [2025-03-03 17:36:48,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:36:48,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:36:48,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:36:48,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:36:48,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:36:48,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2025-03-03 17:36:49,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264ffa255/6d5c73b5df98443a9c7533d9473c5487/FLAGa5db6aa24 [2025-03-03 17:36:49,834 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:36:49,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2025-03-03 17:36:49,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264ffa255/6d5c73b5df98443a9c7533d9473c5487/FLAGa5db6aa24 [2025-03-03 17:36:49,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264ffa255/6d5c73b5df98443a9c7533d9473c5487 [2025-03-03 17:36:49,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:36:49,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:36:49,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:49,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:36:49,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:36:49,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:49" (1/1) ... [2025-03-03 17:36:49,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb10708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:49, skipping insertion in model container [2025-03-03 17:36:49,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:49" (1/1) ... [2025-03-03 17:36:49,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:36:49,997 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.h_b08.c[1245,1258] [2025-03-03 17:36:50,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:50,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:36:50,102 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.h_b08.c[1245,1258] [2025-03-03 17:36:50,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:50,160 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:36:50,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50 WrapperNode [2025-03-03 17:36:50,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:50,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:50,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:36:50,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:36:50,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,229 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 485 [2025-03-03 17:36:50,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:50,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:36:50,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:36:50,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:36:50,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,270 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:36:50,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,283 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:36:50,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:36:50,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:36:50,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:36:50,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:50,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:36:50,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:36:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:36:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:36:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:36:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:36:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:36:50,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:36:50,464 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:36:50,899 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2025-03-03 17:36:50,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:36:50,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:36:50,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:36:50,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:50 BoogieIcfgContainer [2025-03-03 17:36:50,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:36:50,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:36:50,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:36:50,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:36:50,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:36:49" (1/3) ... [2025-03-03 17:36:50,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568388d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:50, skipping insertion in model container [2025-03-03 17:36:50,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (2/3) ... [2025-03-03 17:36:50,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568388d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:50, skipping insertion in model container [2025-03-03 17:36:50,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:50" (3/3) ... [2025-03-03 17:36:50,932 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b08.c [2025-03-03 17:36:50,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:36:50,946 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b08.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:36:50,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:36:50,996 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;@510ec4ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:36:50,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:36:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 17:36:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:51,007 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] [2025-03-03 17:36:51,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1547316110, now seen corresponding path program 1 times [2025-03-03 17:36:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945414294] [2025-03-03 17:36:51,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:51,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 17:36:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 17:36:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:51,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945414294] [2025-03-03 17:36:51,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945414294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955051718] [2025-03-03 17:36:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:51,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:51,710 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:51,796 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2025-03-03 17:36:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-03-03 17:36:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:51,802 INFO L225 Difference]: With dead ends: 121 [2025-03-03 17:36:51,803 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 17:36:51,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:51,808 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:51,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 17:36:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 17:36:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-03-03 17:36:51,834 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 31 [2025-03-03 17:36:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:51,835 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-03-03 17:36:51,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-03-03 17:36:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 17:36:51,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:51,835 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] [2025-03-03 17:36:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:36:51,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:51,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -717480002, now seen corresponding path program 1 times [2025-03-03 17:36:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:51,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742101448] [2025-03-03 17:36:51,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:51,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 17:36:51,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 17:36:51,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:51,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742101448] [2025-03-03 17:36:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742101448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:52,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085179761] [2025-03-03 17:36:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:52,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:52,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:52,075 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:52,138 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2025-03-03 17:36:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2025-03-03 17:36:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:52,140 INFO L225 Difference]: With dead ends: 122 [2025-03-03 17:36:52,140 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 17:36:52,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:52,141 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:52,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 17:36:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 17:36:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-03 17:36:52,149 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 32 [2025-03-03 17:36:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:52,149 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-03 17:36:52,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-03-03 17:36:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 17:36:52,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:52,151 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] [2025-03-03 17:36:52,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:36:52,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:52,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1164465645, now seen corresponding path program 1 times [2025-03-03 17:36:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503994312] [2025-03-03 17:36:52,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:52,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 17:36:52,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 17:36:52,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:52,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:57,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503994312] [2025-03-03 17:36:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503994312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:57,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:57,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:36:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132742353] [2025-03-03 17:36:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:57,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:57,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:57,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:57,731 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:58,293 INFO L93 Difference]: Finished difference Result 124 states and 176 transitions. [2025-03-03 17:36:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:36:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 33 [2025-03-03 17:36:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:58,294 INFO L225 Difference]: With dead ends: 124 [2025-03-03 17:36:58,295 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 17:36:58,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:36:58,295 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 194 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:58,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 387 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 17:36:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 17:36:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2025-03-03 17:36:58,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 33 [2025-03-03 17:36:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:58,300 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2025-03-03 17:36:58,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2025-03-03 17:36:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 17:36:58,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:58,301 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] [2025-03-03 17:36:58,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:36:58,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:58,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:58,301 INFO L85 PathProgramCache]: Analyzing trace with hash -667908157, now seen corresponding path program 1 times [2025-03-03 17:36:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757722143] [2025-03-03 17:36:58,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:36:58,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:36:58,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:58,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:58,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757722143] [2025-03-03 17:36:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757722143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338055292] [2025-03-03 17:36:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:58,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:58,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:58,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:58,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:58,516 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:58,573 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2025-03-03 17:36:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2025-03-03 17:36:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:58,575 INFO L225 Difference]: With dead ends: 122 [2025-03-03 17:36:58,576 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 17:36:58,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:58,577 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:58,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 207 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 17:36:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 17:36:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-03-03 17:36:58,581 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 34 [2025-03-03 17:36:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:58,581 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-03-03 17:36:58,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-03-03 17:36:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:36:58,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:58,582 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] [2025-03-03 17:36:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:36:58,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 149035879, now seen corresponding path program 1 times [2025-03-03 17:36:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:58,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4526220] [2025-03-03 17:36:58,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:58,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:36:58,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:36:58,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:37:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4526220] [2025-03-03 17:37:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4526220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:37:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:37:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:37:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774148759] [2025-03-03 17:37:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:37:01,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:37:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:37:01,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:37:01,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:37:01,907 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:02,544 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2025-03-03 17:37:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:37:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 35 [2025-03-03 17:37:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:02,546 INFO L225 Difference]: With dead ends: 120 [2025-03-03 17:37:02,547 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 17:37:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:37:02,548 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 192 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:02,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 427 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:37:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 17:37:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 17:37:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-03 17:37:02,554 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2025-03-03 17:37:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:02,557 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-03 17:37:02,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-03 17:37:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:37:02,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:02,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:37:02,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:37:02,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:02,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1093130642, now seen corresponding path program 1 times [2025-03-03 17:37:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:37:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215099731] [2025-03-03 17:37:02,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:37:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:37:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:37:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:37:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:37:02,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:37:02,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:37:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:37:02,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:02,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:37:02,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:37:02,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:37:02,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:37:02,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:37:02,777 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 17:37:02,812 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:37:02,833 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:37:02,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:37:02 BoogieIcfgContainer [2025-03-03 17:37:02,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:37:02,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:37:02,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:37:02,836 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:37:02,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:50" (3/4) ... [2025-03-03 17:37:02,838 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:37:02,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:37:02,839 INFO L158 Benchmark]: Toolchain (without parser) took 12974.27ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 106.3MB in the beginning and 300.0MB in the end (delta: -193.6MB). Peak memory consumption was 334.8MB. Max. memory is 16.1GB. [2025-03-03 17:37:02,839 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:37:02,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.14ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 88.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:37:02,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.16ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 81.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:37:02,840 INFO L158 Benchmark]: Boogie Preprocessor took 66.36ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 77.3MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:37:02,840 INFO L158 Benchmark]: IcfgBuilder took 623.90ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 95.3MB in the end (delta: -18.0MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2025-03-03 17:37:02,840 INFO L158 Benchmark]: TraceAbstraction took 11909.06ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 94.8MB in the beginning and 300.1MB in the end (delta: -205.3MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB. [2025-03-03 17:37:02,840 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 671.1MB. Free memory was 300.1MB in the beginning and 300.0MB in the end (delta: 141.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:37:02,841 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.14ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 88.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.16ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 81.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.36ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 77.3MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 623.90ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 95.3MB in the end (delta: -18.0MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11909.06ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 94.8MB in the beginning and 300.1MB in the end (delta: -205.3MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 671.1MB. Free memory was 300.1MB in the beginning and 300.0MB in the end (delta: 141.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 289, overapproximation of bitwiseAnd at line 298. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 20); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (20 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L38] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L39] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L41] const SORT_90 mask_SORT_90 = (SORT_90)-1 >> (sizeof(SORT_90) * 8 - 4); [L42] const SORT_90 msb_SORT_90 = (SORT_90)1 << (4 - 1); [L44] const SORT_6 var_7 = 196596; [L45] const SORT_6 var_8 = 829275; [L46] const SORT_9 var_10 = 0; [L47] const SORT_13 var_15 = 6; [L48] const SORT_13 var_20 = 5; [L49] const SORT_13 var_25 = 4; [L50] const SORT_13 var_30 = 3; [L51] const SORT_13 var_35 = 2; [L52] const SORT_13 var_40 = 1; [L53] const SORT_13 var_45 = 0; [L54] const SORT_6 var_48 = 1047464; [L55] const SORT_6 var_60 = 1048430; [L56] const SORT_6 var_70 = 1046202; [L57] const SORT_6 var_78 = 692223; [L58] const SORT_6 var_84 = 236898; [L59] const SORT_6 var_88 = 522618; [L60] const SORT_1 var_96 = 1; [L61] const SORT_1 var_107 = 0; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_1 input_5; [L66] SORT_6 input_18; [L67] SORT_6 input_23; [L68] SORT_6 input_28; [L69] SORT_6 input_33; [L70] SORT_6 input_38; [L71] SORT_6 input_43; [L72] SORT_6 input_50; [L73] SORT_6 input_52; [L74] SORT_6 input_54; [L75] SORT_6 input_56; [L76] SORT_6 input_58; [L77] SORT_6 input_62; [L78] SORT_6 input_64; [L79] SORT_6 input_66; [L80] SORT_6 input_68; [L81] SORT_6 input_72; [L82] SORT_6 input_74; [L83] SORT_6 input_76; [L84] SORT_6 input_80; [L85] SORT_6 input_82; [L86] SORT_6 input_86; [L87] SORT_3 input_100; [L88] SORT_90 input_102; [L89] SORT_90 input_104; [L90] SORT_1 input_113; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L92] SORT_9 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L93] SORT_1 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] SORT_9 init_12_arg_1 = var_10; [L96] state_11 = init_12_arg_1 [L97] SORT_1 init_109_arg_1 = var_107; [L98] state_108 = init_109_arg_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L101] input_2 = __VERIFIER_nondet_uchar() [L102] input_4 = __VERIFIER_nondet_uchar() [L103] input_5 = __VERIFIER_nondet_uchar() [L104] EXPR input_5 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L104] input_5 = input_5 & mask_SORT_1 [L105] input_18 = __VERIFIER_nondet_uint() [L106] input_23 = __VERIFIER_nondet_uint() [L107] input_28 = __VERIFIER_nondet_uint() [L108] input_33 = __VERIFIER_nondet_uint() [L109] input_38 = __VERIFIER_nondet_uint() [L110] input_43 = __VERIFIER_nondet_uint() [L111] input_50 = __VERIFIER_nondet_uint() [L112] input_52 = __VERIFIER_nondet_uint() [L113] input_54 = __VERIFIER_nondet_uint() [L114] input_56 = __VERIFIER_nondet_uint() [L115] input_58 = __VERIFIER_nondet_uint() [L116] input_62 = __VERIFIER_nondet_uint() [L117] input_64 = __VERIFIER_nondet_uint() [L118] input_66 = __VERIFIER_nondet_uint() [L119] input_68 = __VERIFIER_nondet_uint() [L120] input_72 = __VERIFIER_nondet_uint() [L121] input_74 = __VERIFIER_nondet_uint() [L122] input_76 = __VERIFIER_nondet_uint() [L123] input_80 = __VERIFIER_nondet_uint() [L124] input_82 = __VERIFIER_nondet_uint() [L125] input_86 = __VERIFIER_nondet_uint() [L126] input_100 = __VERIFIER_nondet_uchar() [L127] input_102 = __VERIFIER_nondet_uchar() [L128] input_104 = __VERIFIER_nondet_uchar() [L129] input_113 = __VERIFIER_nondet_uchar() [L132] SORT_9 var_44_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_44_arg_0=0, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L133] EXPR var_44_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L133] var_44_arg_0 = var_44_arg_0 & mask_SORT_9 [L134] SORT_13 var_44 = var_44_arg_0; [L135] SORT_13 var_46_arg_0 = var_44; [L136] SORT_13 var_46_arg_1 = var_45; [L137] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L138] SORT_9 var_39_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_39_arg_0=0, var_40=1, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L139] EXPR var_39_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L139] var_39_arg_0 = var_39_arg_0 & mask_SORT_9 [L140] SORT_13 var_39 = var_39_arg_0; [L141] SORT_13 var_41_arg_0 = var_39; [L142] SORT_13 var_41_arg_1 = var_40; [L143] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L144] SORT_9 var_34_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_34_arg_0=0, var_35=2, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L145] EXPR var_34_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L145] var_34_arg_0 = var_34_arg_0 & mask_SORT_9 [L146] SORT_13 var_34 = var_34_arg_0; [L147] SORT_13 var_36_arg_0 = var_34; [L148] SORT_13 var_36_arg_1 = var_35; [L149] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L150] SORT_9 var_29_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_29_arg_0=0, var_30=3, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L151] EXPR var_29_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L151] var_29_arg_0 = var_29_arg_0 & mask_SORT_9 [L152] SORT_13 var_29 = var_29_arg_0; [L153] SORT_13 var_31_arg_0 = var_29; [L154] SORT_13 var_31_arg_1 = var_30; [L155] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L156] SORT_9 var_24_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_24_arg_0=0, var_25=4, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L157] EXPR var_24_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L157] var_24_arg_0 = var_24_arg_0 & mask_SORT_9 [L158] SORT_13 var_24 = var_24_arg_0; [L159] SORT_13 var_26_arg_0 = var_24; [L160] SORT_13 var_26_arg_1 = var_25; [L161] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L162] SORT_9 var_19_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_19_arg_0=0, var_20=5, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L163] EXPR var_19_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L163] var_19_arg_0 = var_19_arg_0 & mask_SORT_9 [L164] SORT_13 var_19 = var_19_arg_0; [L165] SORT_13 var_21_arg_0 = var_19; [L166] SORT_13 var_21_arg_1 = var_20; [L167] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L168] SORT_9 var_14_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_14_arg_0=0, var_15=6, var_20=5, var_21=0, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L169] EXPR var_14_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_21=0, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L169] var_14_arg_0 = var_14_arg_0 & mask_SORT_9 [L170] SORT_13 var_14 = var_14_arg_0; [L171] SORT_13 var_16_arg_0 = var_14; [L172] SORT_13 var_16_arg_1 = var_15; [L173] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L174] SORT_1 var_17_arg_0 = var_16; [L175] SORT_6 var_17_arg_1 = var_8; [L176] SORT_6 var_17_arg_2 = var_7; [L177] SORT_6 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L178] SORT_1 var_22_arg_0 = var_21; [L179] SORT_6 var_22_arg_1 = input_18; [L180] SORT_6 var_22_arg_2 = var_17; [L181] SORT_6 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L182] SORT_1 var_27_arg_0 = var_26; [L183] SORT_6 var_27_arg_1 = input_23; [L184] SORT_6 var_27_arg_2 = var_22; [L185] SORT_6 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L186] SORT_1 var_32_arg_0 = var_31; [L187] SORT_6 var_32_arg_1 = input_28; [L188] SORT_6 var_32_arg_2 = var_27; [L189] SORT_6 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L190] SORT_1 var_37_arg_0 = var_36; [L191] SORT_6 var_37_arg_1 = input_33; [L192] SORT_6 var_37_arg_2 = var_32; [L193] SORT_6 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L194] SORT_1 var_42_arg_0 = var_41; [L195] SORT_6 var_42_arg_1 = input_38; [L196] SORT_6 var_42_arg_2 = var_37; [L197] SORT_6 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L198] SORT_1 var_47_arg_0 = var_46; [L199] SORT_6 var_47_arg_1 = input_43; [L200] SORT_6 var_47_arg_2 = var_42; [L201] SORT_6 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L202] SORT_1 var_49_arg_0 = var_21; [L203] SORT_6 var_49_arg_1 = var_48; [L204] SORT_6 var_49_arg_2 = var_47; [L205] SORT_6 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L206] SORT_1 var_51_arg_0 = var_26; [L207] SORT_6 var_51_arg_1 = input_50; [L208] SORT_6 var_51_arg_2 = var_49; [L209] SORT_6 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L210] SORT_1 var_53_arg_0 = var_31; [L211] SORT_6 var_53_arg_1 = input_52; [L212] SORT_6 var_53_arg_2 = var_51; [L213] SORT_6 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L214] SORT_1 var_55_arg_0 = var_36; [L215] SORT_6 var_55_arg_1 = input_54; [L216] SORT_6 var_55_arg_2 = var_53; [L217] SORT_6 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L218] SORT_1 var_57_arg_0 = var_41; [L219] SORT_6 var_57_arg_1 = input_56; [L220] SORT_6 var_57_arg_2 = var_55; [L221] SORT_6 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L222] SORT_1 var_59_arg_0 = var_46; [L223] SORT_6 var_59_arg_1 = input_58; [L224] SORT_6 var_59_arg_2 = var_57; [L225] SORT_6 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L226] SORT_1 var_61_arg_0 = var_26; [L227] SORT_6 var_61_arg_1 = var_60; [L228] SORT_6 var_61_arg_2 = var_59; [L229] SORT_6 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L230] SORT_1 var_63_arg_0 = var_31; [L231] SORT_6 var_63_arg_1 = input_62; [L232] SORT_6 var_63_arg_2 = var_61; [L233] SORT_6 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L234] SORT_1 var_65_arg_0 = var_36; [L235] SORT_6 var_65_arg_1 = input_64; [L236] SORT_6 var_65_arg_2 = var_63; [L237] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L238] SORT_1 var_67_arg_0 = var_41; [L239] SORT_6 var_67_arg_1 = input_66; [L240] SORT_6 var_67_arg_2 = var_65; [L241] SORT_6 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L242] SORT_1 var_69_arg_0 = var_46; [L243] SORT_6 var_69_arg_1 = input_68; [L244] SORT_6 var_69_arg_2 = var_67; [L245] SORT_6 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L246] SORT_1 var_71_arg_0 = var_31; [L247] SORT_6 var_71_arg_1 = var_70; [L248] SORT_6 var_71_arg_2 = var_69; [L249] SORT_6 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L250] SORT_1 var_73_arg_0 = var_36; [L251] SORT_6 var_73_arg_1 = input_72; [L252] SORT_6 var_73_arg_2 = var_71; [L253] SORT_6 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L254] SORT_1 var_75_arg_0 = var_41; [L255] SORT_6 var_75_arg_1 = input_74; [L256] SORT_6 var_75_arg_2 = var_73; [L257] SORT_6 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L258] SORT_1 var_77_arg_0 = var_46; [L259] SORT_6 var_77_arg_1 = input_76; [L260] SORT_6 var_77_arg_2 = var_75; [L261] SORT_6 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L262] SORT_1 var_79_arg_0 = var_36; [L263] SORT_6 var_79_arg_1 = var_78; [L264] SORT_6 var_79_arg_2 = var_77; [L265] SORT_6 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L266] SORT_1 var_81_arg_0 = var_41; [L267] SORT_6 var_81_arg_1 = input_80; [L268] SORT_6 var_81_arg_2 = var_79; [L269] SORT_6 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L270] SORT_1 var_83_arg_0 = var_46; [L271] SORT_6 var_83_arg_1 = input_82; [L272] SORT_6 var_83_arg_2 = var_81; [L273] SORT_6 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L274] SORT_1 var_85_arg_0 = var_41; [L275] SORT_6 var_85_arg_1 = var_84; [L276] SORT_6 var_85_arg_2 = var_83; [L277] SORT_6 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L278] SORT_1 var_87_arg_0 = var_46; [L279] SORT_6 var_87_arg_1 = input_86; [L280] SORT_6 var_87_arg_2 = var_85; [L281] SORT_6 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L282] SORT_1 var_89_arg_0 = var_46; [L283] SORT_6 var_89_arg_1 = var_88; [L284] SORT_6 var_89_arg_2 = var_87; [L285] SORT_6 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L286] SORT_6 var_91_arg_0 = var_89; [L287] SORT_90 var_91 = var_91_arg_0 >> 0; [L288] SORT_90 var_92_arg_0 = var_91; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_92_arg_0=522618, var_96=1] [L289] EXPR var_92_arg_0 & mask_SORT_90 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L289] var_92_arg_0 = var_92_arg_0 & mask_SORT_90 [L290] SORT_13 var_92 = var_92_arg_0; [L291] SORT_13 var_93_arg_0 = var_92; [L292] SORT_13 var_93_arg_1 = var_45; [L293] SORT_1 var_93 = var_93_arg_0 != var_93_arg_1; [L294] SORT_1 var_97_arg_0 = var_93; [L295] SORT_1 var_97 = ~var_97_arg_0; [L296] SORT_1 var_98_arg_0 = var_96; [L297] SORT_1 var_98_arg_1 = var_97; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1, var_98_arg_0=1, var_98_arg_1=-2] [L298] EXPR var_98_arg_0 & var_98_arg_1 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L298] SORT_1 var_98 = var_98_arg_0 & var_98_arg_1; [L299] EXPR var_98 & mask_SORT_1 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L299] var_98 = var_98 & mask_SORT_1 [L300] SORT_1 bad_99_arg_0 = var_98; [L301] CALL __VERIFIER_assert(!(bad_99_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1458 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1096 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 362 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:37:02,865 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.h_b08.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 f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:37:04,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:37:04,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:37:04,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:37:04,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:37:04,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:37:04,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:37:04,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:37:04,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:37:04,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:37:04,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:37:04,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:37:04,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:37:04,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:37:04,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:37:04,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:37:04,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:37:04,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:37:04,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:37:04,793 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 -> f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f [2025-03-03 17:37:05,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:37:05,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:37:05,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:37:05,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:37:05,065 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:37:05,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2025-03-03 17:37:06,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2458a31b/35a4f850eb114a958420b53de82d4614/FLAG6541a0cca [2025-03-03 17:37:06,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:37:06,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2025-03-03 17:37:06,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2458a31b/35a4f850eb114a958420b53de82d4614/FLAG6541a0cca [2025-03-03 17:37:06,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2458a31b/35a4f850eb114a958420b53de82d4614 [2025-03-03 17:37:06,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:37:06,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:37:06,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:37:06,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:37:06,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:37:06,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff55852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06, skipping insertion in model container [2025-03-03 17:37:06,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:37:06,667 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.h_b08.c[1245,1258] [2025-03-03 17:37:06,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:37:06,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:37:06,779 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.h_b08.c[1245,1258] [2025-03-03 17:37:06,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:37:06,840 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:37:06,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06 WrapperNode [2025-03-03 17:37:06,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:37:06,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:37:06,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:37:06,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:37:06,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,889 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 373 [2025-03-03 17:37:06,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:37:06,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:37:06,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:37:06,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:37:06,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,921 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:37:06,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:37:06,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:37:06,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:37:06,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:37:06,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (1/1) ... [2025-03-03 17:37:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:37:06,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:37:06,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:37:06,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:37:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:37:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:37:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:37:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:37:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:37:07,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:37:07,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:37:07,388 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2025-03-03 17:37:07,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:37:07,399 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:37:07,399 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:37:07,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:37:07 BoogieIcfgContainer [2025-03-03 17:37:07,400 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:37:07,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:37:07,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:37:07,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:37:07,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:37:06" (1/3) ... [2025-03-03 17:37:07,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e272d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:37:07, skipping insertion in model container [2025-03-03 17:37:07,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:37:06" (2/3) ... [2025-03-03 17:37:07,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e272d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:37:07, skipping insertion in model container [2025-03-03 17:37:07,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:37:07" (3/3) ... [2025-03-03 17:37:07,409 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b08.c [2025-03-03 17:37:07,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:37:07,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b08.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:37:07,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:37:07,483 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;@999167c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:37:07,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:37:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:37:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:07,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:37:07,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:37:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:37:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462895497] [2025-03-03 17:37:07,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:37:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:37:07,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:37:07,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:37:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:37:07,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:37:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:07,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 17:37:07,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:37:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:08,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:37:08,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:37:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462895497] [2025-03-03 17:37:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462895497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:37:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:37:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:37:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333779128] [2025-03-03 17:37:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:37:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:37:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:37:08,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:37:08,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:37:08,100 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:08,181 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:37:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:37:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:37:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:08,189 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:37:08,189 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:37:08,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:37:08,193 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:08,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:37:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:37:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:37:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:37:08,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:37:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:37:08,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:37:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:37:08,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:08,214 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:37:08,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:37:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:08,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:37:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:37:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117503007] [2025-03-03 17:37:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:37:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:37:08,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:37:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:37:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:37:08,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:37:08,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:08,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:08,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 17:37:08,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:37:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:08,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:37:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:09,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:37:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117503007] [2025-03-03 17:37:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117503007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:37:09,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:37:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-03 17:37:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125142412] [2025-03-03 17:37:09,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:37:09,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:37:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:37:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:37:09,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:37:09,628 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:09,942 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-03 17:37:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:37:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:37:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:09,943 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:37:09,943 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 17:37:09,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:37:09,944 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:09,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:37:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 17:37:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 17:37:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 17:37:09,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-03 17:37:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 17:37:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 17:37:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:37:09,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:09,947 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 17:37:09,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:37:10,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:10,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-03 17:37:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:37:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872426511] [2025-03-03 17:37:10,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:37:10,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:37:10,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:37:10,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:37:10,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 17:37:10,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 14 statements. [2025-03-03 17:37:10,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 17:37:10,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:10,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-03 17:37:10,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:37:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:37:13,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:37:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:37:17,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:37:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872426511] [2025-03-03 17:37:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872426511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:37:17,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:37:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 17:37:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001493517] [2025-03-03 17:37:17,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:37:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:37:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:37:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:37:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:37:17,853 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:17,907 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-03 17:37:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:37:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 17:37:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:17,908 INFO L225 Difference]: With dead ends: 15 [2025-03-03 17:37:17,908 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 17:37:17,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:37:17,909 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:17,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:37:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 17:37:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 17:37:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 17:37:17,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-03-03 17:37:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:17,910 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 17:37:17,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 17:37:17,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 17:37:17,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:37:17,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 17:37:18,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:37:18,115 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-03 17:37:18,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 17:37:18,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:37:18,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:37:18 BoogieIcfgContainer [2025-03-03 17:37:18,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:37:18,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:37:18,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:37:18,248 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:37:18,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:37:07" (3/4) ... [2025-03-03 17:37:18,250 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 17:37:18,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 17:37:18,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-03 17:37:18,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 17:37:18,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 17:37:18,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 17:37:18,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 17:37:18,344 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 17:37:18,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:37:18,346 INFO L158 Benchmark]: Toolchain (without parser) took 11824.28ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 58.7MB in the beginning and 500.7MB in the end (delta: -442.1MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,347 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:37:18,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.83ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 40.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 83.9MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:37:18,348 INFO L158 Benchmark]: Boogie Preprocessor took 54.10ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 34.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,348 INFO L158 Benchmark]: IcfgBuilder took 455.02ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 28.4MB in the end (delta: 5.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,348 INFO L158 Benchmark]: TraceAbstraction took 10843.26ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 27.6MB in the beginning and 509.0MB in the end (delta: -481.4MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,349 INFO L158 Benchmark]: Witness Printer took 96.15ms. Allocated memory is still 671.1MB. Free memory was 509.0MB in the beginning and 500.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:37:18,350 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.26ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.83ms. Allocated memory is still 83.9MB. Free memory was 58.5MB in the beginning and 40.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 83.9MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.10ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 34.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 455.02ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 28.4MB in the end (delta: 5.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10843.26ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 27.6MB in the beginning and 509.0MB in the end (delta: -481.4MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. * Witness Printer took 96.15ms. Allocated memory is still 671.1MB. Free memory was 509.0MB in the beginning and 500.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 27 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 14 QuantifiedInterpolants, 7383 SizeOfPredicates, 32 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 24/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 99]: Location Invariant Derived location invariant: (((((((((((((7 == mask_SORT_9) && (1046202 == var_70)) && (196596 == var_7)) && (522618 == var_88)) && (1047464 == var_48)) && (1 == var_40)) && (0 == var_45)) && (692223 == var_78)) && (15 == mask_SORT_90)) && (1048430 == var_60)) && (1 == mask_SORT_1)) && (829275 == var_8)) && (236898 == var_84)) RESULT: Ultimate proved your program to be correct! [2025-03-03 17:37:18,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE