./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:15:14,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:15:14,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:15:14,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:15:14,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:15:14,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:15:14,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:15:14,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:15:14,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:15:14,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:15:14,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:15:14,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:15:14,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:15:14,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:15:14,196 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:15:14,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:15:14,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:15:14,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:14,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:14,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:15:14,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:15:14,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:15:14,199 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-jdk21/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 -> 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d [2025-01-09 06:15:14,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:15:14,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:15:14,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:15:14,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:15:14,468 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:15:14,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2025-01-09 06:15:15,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c27c20a34/2d215f576a944169a7b75ec9ab6ef24c/FLAG2686e1269 [2025-01-09 06:15:15,966 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:15:15,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2025-01-09 06:15:15,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c27c20a34/2d215f576a944169a7b75ec9ab6ef24c/FLAG2686e1269 [2025-01-09 06:15:16,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c27c20a34/2d215f576a944169a7b75ec9ab6ef24c [2025-01-09 06:15:16,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:15:16,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:15:16,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:16,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:15:16,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:15:16,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:16,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d8840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16, skipping insertion in model container [2025-01-09 06:15:16,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:16,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:15:16,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c[1244,1257] [2025-01-09 06:15:16,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:16,488 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:15:16,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c[1244,1257] [2025-01-09 06:15:16,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:16,754 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:15:16,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16 WrapperNode [2025-01-09 06:15:16,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:16,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:16,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:15:16,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:15:16,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:16,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,255 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4789 [2025-01-09 06:15:17,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:17,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:15:17,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:15:17,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:15:17,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,554 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:15:17,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:15:17,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:15:17,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:15:17,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:15:17,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (1/1) ... [2025-01-09 06:15:17,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:17,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:15:17,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:15:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:15:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:15:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:15:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:15:17,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:15:18,349 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:15:18,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:15:21,119 INFO L? ?]: Removed 3293 outVars from TransFormulas that were not future-live. [2025-01-09 06:15:21,120 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:15:21,139 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:15:21,139 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:15:21,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:21 BoogieIcfgContainer [2025-01-09 06:15:21,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:15:21,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:15:21,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:15:21,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:15:21,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:15:16" (1/3) ... [2025-01-09 06:15:21,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49272bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:21, skipping insertion in model container [2025-01-09 06:15:21,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:16" (2/3) ... [2025-01-09 06:15:21,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49272bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:21, skipping insertion in model container [2025-01-09 06:15:21,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:21" (3/3) ... [2025-01-09 06:15:21,146 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Heap.c [2025-01-09 06:15:21,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:15:21,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.Heap.c that has 1 procedures, 850 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:15:21,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:15:21,240 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;@412ea2ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:15:21,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:15:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 850 states, 848 states have (on average 1.4988207547169812) internal successors, (1271), 849 states have internal predecessors, (1271), 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-01-09 06:15:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 06:15:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:21,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:21,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:21,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 59079382, now seen corresponding path program 1 times [2025-01-09 06:15:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53684846] [2025-01-09 06:15:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:21,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:21,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 06:15:21,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 06:15:21,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53684846] [2025-01-09 06:15:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53684846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125787155] [2025-01-09 06:15:21,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:21,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:21,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:21,905 INFO L87 Difference]: Start difference. First operand has 850 states, 848 states have (on average 1.4988207547169812) internal successors, (1271), 849 states have internal predecessors, (1271), 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 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-09 06:15:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:21,987 INFO L93 Difference]: Finished difference Result 1653 states and 2475 transitions. [2025-01-09 06:15:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2025-01-09 06:15:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:21,998 INFO L225 Difference]: With dead ends: 1653 [2025-01-09 06:15:21,998 INFO L226 Difference]: Without dead ends: 849 [2025-01-09 06:15:22,001 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-01-09 06:15:22,003 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 0 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:22,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3789 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-01-09 06:15:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2025-01-09 06:15:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.4964622641509433) internal successors, (1269), 848 states have internal predecessors, (1269), 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-01-09 06:15:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1269 transitions. [2025-01-09 06:15:22,068 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1269 transitions. Word has length 43 [2025-01-09 06:15:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:22,068 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1269 transitions. [2025-01-09 06:15:22,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-09 06:15:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1269 transitions. [2025-01-09 06:15:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 06:15:22,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:22,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:22,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:15:22,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1833156242, now seen corresponding path program 1 times [2025-01-09 06:15:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:22,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039769770] [2025-01-09 06:15:22,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 06:15:22,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 06:15:22,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:22,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:22,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039769770] [2025-01-09 06:15:22,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039769770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:22,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:22,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807135620] [2025-01-09 06:15:22,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:22,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:22,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:22,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:22,294 INFO L87 Difference]: Start difference. First operand 849 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-01-09 06:15:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:22,403 INFO L93 Difference]: Finished difference Result 1654 states and 2473 transitions. [2025-01-09 06:15:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-01-09 06:15:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:22,407 INFO L225 Difference]: With dead ends: 1654 [2025-01-09 06:15:22,407 INFO L226 Difference]: Without dead ends: 851 [2025-01-09 06:15:22,412 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-01-09 06:15:22,413 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 0 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3785 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:22,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3785 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-01-09 06:15:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2025-01-09 06:15:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4952941176470589) internal successors, (1271), 850 states have internal predecessors, (1271), 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-01-09 06:15:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1271 transitions. [2025-01-09 06:15:22,439 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1271 transitions. Word has length 44 [2025-01-09 06:15:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:22,440 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1271 transitions. [2025-01-09 06:15:22,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-01-09 06:15:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1271 transitions. [2025-01-09 06:15:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 06:15:22,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:22,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:22,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:15:22,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:22,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash -104697041, now seen corresponding path program 1 times [2025-01-09 06:15:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:22,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534358528] [2025-01-09 06:15:22,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:22,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:22,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 06:15:22,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 06:15:22,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:22,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534358528] [2025-01-09 06:15:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534358528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:22,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:15:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646347495] [2025-01-09 06:15:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:15:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:15:22,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:22,755 INFO L87 Difference]: Start difference. First operand 851 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-01-09 06:15:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:22,829 INFO L93 Difference]: Finished difference Result 1660 states and 2480 transitions. [2025-01-09 06:15:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:15:22,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2025-01-09 06:15:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:22,834 INFO L225 Difference]: With dead ends: 1660 [2025-01-09 06:15:22,834 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 06:15:22,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:15:22,838 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1236 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3778 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:22,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3778 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:15:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 06:15:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 854. [2025-01-09 06:15:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.4935521688159437) internal successors, (1274), 853 states have internal predecessors, (1274), 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-01-09 06:15:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1274 transitions. [2025-01-09 06:15:22,851 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1274 transitions. Word has length 45 [2025-01-09 06:15:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:22,851 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1274 transitions. [2025-01-09 06:15:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-01-09 06:15:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1274 transitions. [2025-01-09 06:15:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 06:15:22,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:22,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:15:22,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1681062923, now seen corresponding path program 1 times [2025-01-09 06:15:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867340811] [2025-01-09 06:15:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:22,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 06:15:22,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 06:15:22,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:22,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867340811] [2025-01-09 06:15:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867340811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:15:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41099993] [2025-01-09 06:15:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:23,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:15:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:23,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:15:23,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:15:23,861 INFO L87 Difference]: Start difference. First operand 854 states and 1274 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-01-09 06:15:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:24,033 INFO L93 Difference]: Finished difference Result 1687 states and 2517 transitions. [2025-01-09 06:15:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:15:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 46 [2025-01-09 06:15:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:24,038 INFO L225 Difference]: With dead ends: 1687 [2025-01-09 06:15:24,038 INFO L226 Difference]: Without dead ends: 879 [2025-01-09 06:15:24,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:15:24,044 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 1281 mSDsluCounter, 7503 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 8754 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:24,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 8754 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-09 06:15:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 865. [2025-01-09 06:15:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 1.4930555555555556) internal successors, (1290), 864 states have internal predecessors, (1290), 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-01-09 06:15:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1290 transitions. [2025-01-09 06:15:24,062 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1290 transitions. Word has length 46 [2025-01-09 06:15:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:24,062 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1290 transitions. [2025-01-09 06:15:24,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-01-09 06:15:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1290 transitions. [2025-01-09 06:15:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 06:15:24,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:24,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:15:24,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1958246073, now seen corresponding path program 1 times [2025-01-09 06:15:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332156516] [2025-01-09 06:15:24,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:24,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 06:15:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 06:15:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:15:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332156516] [2025-01-09 06:15:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332156516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:15:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407997031] [2025-01-09 06:15:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:15:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:15:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:15:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:15:24,445 INFO L87 Difference]: Start difference. First operand 865 states and 1290 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-01-09 06:15:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:24,572 INFO L93 Difference]: Finished difference Result 1694 states and 2526 transitions. [2025-01-09 06:15:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:15:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 46 [2025-01-09 06:15:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:24,575 INFO L225 Difference]: With dead ends: 1694 [2025-01-09 06:15:24,575 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 06:15:24,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:15:24,578 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 1245 mSDsluCounter, 7489 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 8740 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:24,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 8740 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:15:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 06:15:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 871. [2025-01-09 06:15:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.4919540229885058) internal successors, (1298), 870 states have internal predecessors, (1298), 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-01-09 06:15:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1298 transitions. [2025-01-09 06:15:24,592 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1298 transitions. Word has length 46 [2025-01-09 06:15:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1298 transitions. [2025-01-09 06:15:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-01-09 06:15:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1298 transitions. [2025-01-09 06:15:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 06:15:24,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:24,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:15:24,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:24,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2140631467, now seen corresponding path program 1 times [2025-01-09 06:15:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:15:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512014322] [2025-01-09 06:15:24,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:15:24,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 06:15:24,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 06:15:24,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:24,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:15:24,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 06:15:24,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 06:15:24,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 06:15:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:15:24,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 06:15:24,761 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 06:15:24,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 06:15:24,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:15:24,767 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 06:15:24,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:15:24,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:15:24 BoogieIcfgContainer [2025-01-09 06:15:24,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:15:24,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:15:24,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:15:24,828 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:15:24,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:21" (3/4) ... [2025-01-09 06:15:24,831 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 06:15:24,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:15:24,833 INFO L158 Benchmark]: Toolchain (without parser) took 8829.60ms. Allocated memory was 167.8MB in the beginning and 536.9MB in the end (delta: 369.1MB). Free memory was 128.1MB in the beginning and 353.9MB in the end (delta: -225.9MB). Peak memory consumption was 150.8MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,834 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:15:24,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 754.15ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 127.6MB in the beginning and 103.7MB in the end (delta: 23.9MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 497.07ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 63.5MB in the end (delta: 40.3MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,835 INFO L158 Benchmark]: Boogie Preprocessor took 669.92ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 63.5MB in the beginning and 485.8MB in the end (delta: -422.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,835 INFO L158 Benchmark]: RCFGBuilder took 3213.00ms. Allocated memory is still 604.0MB. Free memory was 485.8MB in the beginning and 303.8MB in the end (delta: 182.0MB). Peak memory consumption was 288.0MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,835 INFO L158 Benchmark]: TraceAbstraction took 3686.63ms. Allocated memory was 604.0MB in the beginning and 536.9MB in the end (delta: -67.1MB). Free memory was 303.8MB in the beginning and 354.0MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:15:24,835 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 536.9MB. Free memory was 354.0MB in the beginning and 353.9MB in the end (delta: 45.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 06:15:24,836 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.83ms. Allocated memory is still 226.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 754.15ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 127.6MB in the beginning and 103.7MB in the end (delta: 23.9MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 497.07ms. Allocated memory is still 176.2MB. Free memory was 103.7MB in the beginning and 63.5MB in the end (delta: 40.3MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 669.92ms. Allocated memory was 176.2MB in the beginning and 604.0MB in the end (delta: 427.8MB). Free memory was 63.5MB in the beginning and 485.8MB in the end (delta: -422.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3213.00ms. Allocated memory is still 604.0MB. Free memory was 485.8MB in the beginning and 303.8MB in the end (delta: 182.0MB). Peak memory consumption was 288.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3686.63ms. Allocated memory was 604.0MB in the beginning and 536.9MB in the end (delta: -67.1MB). Free memory was 303.8MB in the beginning and 354.0MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 536.9MB. Free memory was 354.0MB in the beginning and 353.9MB in the end (delta: 45.7kB). 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 - 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 358. 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 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L35] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 3); [L36] const SORT_13 msb_SORT_13 = (SORT_13)1 << (3 - 1); [L38] const SORT_55 mask_SORT_55 = (SORT_55)-1 >> (sizeof(SORT_55) * 8 - 29); [L39] const SORT_55 msb_SORT_55 = (SORT_55)1 << (29 - 1); [L41] const SORT_1 var_6 = 0; [L42] const SORT_9 var_11 = 0; [L43] const SORT_13 var_14 = 0; [L44] const SORT_1 var_27 = 1; [L45] const SORT_9 var_35 = 4; [L46] const SORT_3 var_38 = 0; [L47] const SORT_55 var_56 = 0; [L48] const SORT_9 var_60 = 1; [L49] const SORT_3 var_82 = 2; [L50] const SORT_3 var_87 = 3; [L51] const SORT_13 var_93 = 1; [L52] const SORT_13 var_96 = 3; [L53] const SORT_13 var_99 = 2; [L54] const SORT_13 var_103 = 5; [L55] const SORT_3 var_109 = 1; [L56] const SORT_13 var_117 = 7; [L57] const SORT_13 var_126 = 6; [L58] const SORT_13 var_130 = 4; [L60] SORT_1 input_2; [L61] SORT_3 input_4; [L62] SORT_3 input_5; [L63] SORT_1 input_81; [L64] SORT_1 input_106; [L65] SORT_3 input_107; [L66] SORT_13 input_137; [L67] SORT_13 input_138; [L68] SORT_13 input_139; [L69] SORT_13 input_150; [L70] SORT_13 input_151; [L71] SORT_3 input_191; [L72] SORT_3 input_192; [L73] SORT_3 input_193; [L74] SORT_3 input_199; [L75] SORT_3 input_200; [L76] SORT_3 input_201; [L77] SORT_3 input_202; [L78] SORT_3 input_203; [L79] SORT_3 input_251; [L80] SORT_3 input_263; [L81] SORT_3 input_281; [L82] SORT_3 input_282; [L83] SORT_3 input_290; [L84] SORT_3 input_316; [L85] SORT_3 input_341; [L86] SORT_3 input_342; [L87] SORT_3 input_343; [L88] SORT_3 input_360; [L89] SORT_3 input_361; [L90] SORT_3 input_369; [L91] SORT_3 input_377; [L92] SORT_3 input_378; [L93] SORT_3 input_397; [L94] SORT_3 input_398; [L95] SORT_3 input_399; [L96] SORT_3 input_407; [L97] SORT_3 input_414; [L98] SORT_3 input_425; [L99] SORT_3 input_426; [L100] SORT_3 input_435; [L101] SORT_3 input_440; [L102] SORT_3 input_444; [L103] SORT_3 input_445; [L104] SORT_3 input_474; [L105] SORT_3 input_475; [L106] SORT_3 input_483; [L107] SORT_3 input_487; [L108] SORT_3 input_488; [L109] SORT_3 input_507; [L110] SORT_3 input_508; [L111] SORT_3 input_509; [L112] SORT_3 input_517; [L113] SORT_3 input_519; [L114] SORT_3 input_523; [L115] SORT_3 input_524; [L116] SORT_3 input_533; [L117] SORT_3 input_538; [L118] SORT_3 input_542; [L119] SORT_3 input_543; [L120] SORT_3 input_572; [L121] SORT_3 input_573; [L122] SORT_3 input_581; [L123] SORT_3 input_585; [L124] SORT_3 input_586; [L125] SORT_3 input_605; [L126] SORT_3 input_606; [L127] SORT_3 input_607; [L128] SORT_3 input_615; [L129] SORT_3 input_617; [L130] SORT_3 input_621; [L131] SORT_3 input_622; [L132] SORT_3 input_631; [L133] SORT_3 input_636; [L134] SORT_3 input_640; [L135] SORT_3 input_641; [L136] SORT_3 input_670; [L137] SORT_3 input_671; [L138] SORT_3 input_679; [L139] SORT_3 input_683; [L140] SORT_3 input_684; [L141] SORT_3 input_703; [L142] SORT_3 input_704; [L143] SORT_3 input_705; [L144] SORT_3 input_713; [L145] SORT_3 input_715; [L146] SORT_3 input_719; [L147] SORT_3 input_720; [L148] SORT_3 input_729; [L149] SORT_3 input_734; [L150] SORT_3 input_738; [L151] SORT_3 input_739; [L152] SORT_13 input_766; [L153] SORT_13 input_767; [L154] SORT_13 input_768; [L155] SORT_13 input_774; [L156] SORT_13 input_775; [L157] SORT_13 input_792; [L158] SORT_13 input_803; [L159] SORT_13 input_804; [L160] SORT_13 input_806; [L161] SORT_13 input_815; [L162] SORT_13 input_833; [L163] SORT_13 input_834; [L164] SORT_13 input_835; [L165] SORT_13 input_841; [L166] SORT_13 input_842; [L167] SORT_13 input_859; [L168] SORT_13 input_868; [L169] SORT_13 input_869; [L170] SORT_13 input_871; [L171] SORT_13 input_880; [L172] SORT_13 input_884; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L174] SORT_1 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L175] SORT_13 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L176] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L177] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L178] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L179] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L179] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L180] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L181] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L181] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L182] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L182] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L183] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L183] SORT_13 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L184] EXPR __VERIFIER_nondet_uchar() & mask_SORT_13 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L184] SORT_13 state_75 = __VERIFIER_nondet_uchar() & mask_SORT_13; [L186] SORT_1 init_8_arg_1 = var_6; [L187] state_7 = init_8_arg_1 [L188] SORT_13 init_16_arg_1 = var_14; [L189] state_15 = init_16_arg_1 [L190] SORT_3 init_40_arg_1 = var_38; [L191] state_39 = init_40_arg_1 [L192] SORT_3 init_42_arg_1 = var_38; [L193] state_41 = init_42_arg_1 [L194] SORT_3 init_44_arg_1 = var_38; [L195] state_43 = init_44_arg_1 [L196] SORT_3 init_46_arg_1 = var_38; [L197] state_45 = init_46_arg_1 [L198] SORT_3 init_48_arg_1 = var_38; [L199] state_47 = init_48_arg_1 [L200] SORT_3 init_50_arg_1 = var_38; [L201] state_49 = init_50_arg_1 [L202] SORT_3 init_52_arg_1 = var_38; [L203] state_51 = init_52_arg_1 [L204] SORT_13 init_54_arg_1 = var_14; [L205] state_53 = init_54_arg_1 [L206] SORT_13 init_76_arg_1 = var_14; [L207] state_75 = init_76_arg_1 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L210] input_2 = __VERIFIER_nondet_uchar() [L211] input_4 = __VERIFIER_nondet_uchar() [L212] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L212] input_4 = input_4 & mask_SORT_3 [L213] input_5 = __VERIFIER_nondet_uchar() [L214] input_81 = __VERIFIER_nondet_uchar() [L215] input_106 = __VERIFIER_nondet_uchar() [L216] input_107 = __VERIFIER_nondet_uchar() [L217] input_137 = __VERIFIER_nondet_uchar() [L218] input_138 = __VERIFIER_nondet_uchar() [L219] input_139 = __VERIFIER_nondet_uchar() [L220] input_150 = __VERIFIER_nondet_uchar() [L221] input_151 = __VERIFIER_nondet_uchar() [L222] input_191 = __VERIFIER_nondet_uchar() [L223] input_192 = __VERIFIER_nondet_uchar() [L224] input_193 = __VERIFIER_nondet_uchar() [L225] input_199 = __VERIFIER_nondet_uchar() [L226] input_200 = __VERIFIER_nondet_uchar() [L227] input_201 = __VERIFIER_nondet_uchar() [L228] input_202 = __VERIFIER_nondet_uchar() [L229] input_203 = __VERIFIER_nondet_uchar() [L230] input_251 = __VERIFIER_nondet_uchar() [L231] input_263 = __VERIFIER_nondet_uchar() [L232] input_281 = __VERIFIER_nondet_uchar() [L233] input_282 = __VERIFIER_nondet_uchar() [L234] input_290 = __VERIFIER_nondet_uchar() [L235] input_316 = __VERIFIER_nondet_uchar() [L236] input_341 = __VERIFIER_nondet_uchar() [L237] input_342 = __VERIFIER_nondet_uchar() [L238] input_343 = __VERIFIER_nondet_uchar() [L239] input_360 = __VERIFIER_nondet_uchar() [L240] input_361 = __VERIFIER_nondet_uchar() [L241] input_369 = __VERIFIER_nondet_uchar() [L242] input_377 = __VERIFIER_nondet_uchar() [L243] input_378 = __VERIFIER_nondet_uchar() [L244] input_397 = __VERIFIER_nondet_uchar() [L245] input_398 = __VERIFIER_nondet_uchar() [L246] input_399 = __VERIFIER_nondet_uchar() [L247] input_407 = __VERIFIER_nondet_uchar() [L248] input_414 = __VERIFIER_nondet_uchar() [L249] input_425 = __VERIFIER_nondet_uchar() [L250] input_426 = __VERIFIER_nondet_uchar() [L251] input_435 = __VERIFIER_nondet_uchar() [L252] input_440 = __VERIFIER_nondet_uchar() [L253] input_444 = __VERIFIER_nondet_uchar() [L254] input_445 = __VERIFIER_nondet_uchar() [L255] input_474 = __VERIFIER_nondet_uchar() [L256] input_475 = __VERIFIER_nondet_uchar() [L257] input_483 = __VERIFIER_nondet_uchar() [L258] input_487 = __VERIFIER_nondet_uchar() [L259] input_488 = __VERIFIER_nondet_uchar() [L260] input_507 = __VERIFIER_nondet_uchar() [L261] input_508 = __VERIFIER_nondet_uchar() [L262] input_509 = __VERIFIER_nondet_uchar() [L263] input_517 = __VERIFIER_nondet_uchar() [L264] input_519 = __VERIFIER_nondet_uchar() [L265] input_523 = __VERIFIER_nondet_uchar() [L266] input_524 = __VERIFIER_nondet_uchar() [L267] input_533 = __VERIFIER_nondet_uchar() [L268] input_538 = __VERIFIER_nondet_uchar() [L269] input_542 = __VERIFIER_nondet_uchar() [L270] input_543 = __VERIFIER_nondet_uchar() [L271] input_572 = __VERIFIER_nondet_uchar() [L272] input_573 = __VERIFIER_nondet_uchar() [L273] input_581 = __VERIFIER_nondet_uchar() [L274] input_585 = __VERIFIER_nondet_uchar() [L275] input_586 = __VERIFIER_nondet_uchar() [L276] input_605 = __VERIFIER_nondet_uchar() [L277] input_606 = __VERIFIER_nondet_uchar() [L278] input_607 = __VERIFIER_nondet_uchar() [L279] input_615 = __VERIFIER_nondet_uchar() [L280] input_617 = __VERIFIER_nondet_uchar() [L281] input_621 = __VERIFIER_nondet_uchar() [L282] input_622 = __VERIFIER_nondet_uchar() [L283] input_631 = __VERIFIER_nondet_uchar() [L284] input_636 = __VERIFIER_nondet_uchar() [L285] input_640 = __VERIFIER_nondet_uchar() [L286] input_641 = __VERIFIER_nondet_uchar() [L287] input_670 = __VERIFIER_nondet_uchar() [L288] input_671 = __VERIFIER_nondet_uchar() [L289] input_679 = __VERIFIER_nondet_uchar() [L290] input_683 = __VERIFIER_nondet_uchar() [L291] input_684 = __VERIFIER_nondet_uchar() [L292] input_703 = __VERIFIER_nondet_uchar() [L293] input_704 = __VERIFIER_nondet_uchar() [L294] input_705 = __VERIFIER_nondet_uchar() [L295] input_713 = __VERIFIER_nondet_uchar() [L296] input_715 = __VERIFIER_nondet_uchar() [L297] input_719 = __VERIFIER_nondet_uchar() [L298] input_720 = __VERIFIER_nondet_uchar() [L299] input_729 = __VERIFIER_nondet_uchar() [L300] input_734 = __VERIFIER_nondet_uchar() [L301] input_738 = __VERIFIER_nondet_uchar() [L302] input_739 = __VERIFIER_nondet_uchar() [L303] input_766 = __VERIFIER_nondet_uchar() [L304] input_767 = __VERIFIER_nondet_uchar() [L305] input_768 = __VERIFIER_nondet_uchar() [L306] input_774 = __VERIFIER_nondet_uchar() [L307] input_775 = __VERIFIER_nondet_uchar() [L308] input_792 = __VERIFIER_nondet_uchar() [L309] input_803 = __VERIFIER_nondet_uchar() [L310] input_804 = __VERIFIER_nondet_uchar() [L311] input_806 = __VERIFIER_nondet_uchar() [L312] input_815 = __VERIFIER_nondet_uchar() [L313] input_833 = __VERIFIER_nondet_uchar() [L314] input_834 = __VERIFIER_nondet_uchar() [L315] input_835 = __VERIFIER_nondet_uchar() [L316] input_841 = __VERIFIER_nondet_uchar() [L317] input_842 = __VERIFIER_nondet_uchar() [L318] input_859 = __VERIFIER_nondet_uchar() [L319] input_868 = __VERIFIER_nondet_uchar() [L320] input_869 = __VERIFIER_nondet_uchar() [L321] input_871 = __VERIFIER_nondet_uchar() [L322] input_880 = __VERIFIER_nondet_uchar() [L323] input_884 = __VERIFIER_nondet_uchar() [L326] SORT_1 var_10_arg_0 = state_7; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_10_arg_0=0, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L327] EXPR var_10_arg_0 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L327] var_10_arg_0 = var_10_arg_0 & mask_SORT_1 [L328] SORT_9 var_10 = var_10_arg_0; [L329] SORT_9 var_12_arg_0 = var_10; [L330] SORT_9 var_12_arg_1 = var_11; [L331] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L332] SORT_13 var_17_arg_0 = state_15; [L333] SORT_1 var_17 = var_17_arg_0 >> 2; [L334] SORT_1 var_18_arg_0 = var_17; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_18_arg_0=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L335] EXPR var_18_arg_0 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L335] var_18_arg_0 = var_18_arg_0 & mask_SORT_1 [L336] SORT_9 var_18 = var_18_arg_0; [L337] SORT_9 var_19_arg_0 = var_18; [L338] SORT_9 var_19_arg_1 = var_11; [L339] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L340] SORT_13 var_20_arg_0 = state_15; [L341] SORT_3 var_20 = var_20_arg_0 >> 0; [L342] SORT_3 var_21_arg_0 = var_20; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_19=1, var_21_arg_0=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L343] EXPR var_21_arg_0 & mask_SORT_3 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_19=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L343] var_21_arg_0 = var_21_arg_0 & mask_SORT_3 [L344] SORT_9 var_21 = var_21_arg_0; [L345] SORT_9 var_22_arg_0 = var_21; [L346] SORT_9 var_22_arg_1 = var_11; [L347] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L348] SORT_1 var_23_arg_0 = var_19; [L349] SORT_1 var_23_arg_1 = var_22; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_23_arg_0=1, var_23_arg_1=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L350] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_12=1, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L350] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L351] SORT_1 var_24_arg_0 = var_12; [L352] SORT_1 var_24_arg_1 = var_23; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_24_arg_0=1, var_24_arg_1=1, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L353] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L353] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L354] SORT_1 var_28_arg_0 = var_24; [L355] SORT_1 var_28 = ~var_28_arg_0; [L356] SORT_1 var_29_arg_0 = var_27; [L357] SORT_1 var_29_arg_1 = var_28; VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_29_arg_0=1, var_29_arg_1=-2, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L358] EXPR var_29_arg_0 & var_29_arg_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L358] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L359] EXPR var_29 & mask_SORT_1 VAL [input_4=0, mask_SORT_13=7, mask_SORT_1=1, mask_SORT_3=3, state_15=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_75=0, state_7=0, var_103=5, var_109=1, var_117=7, var_11=0, var_126=6, var_130=4, var_14=0, var_27=1, var_35=4, var_38=0, var_56=0, var_60=1, var_6=0, var_82=2, var_87=3, var_93=1, var_96=3, var_99=2] [L359] var_29 = var_29 & mask_SORT_1 [L360] SORT_1 bad_30_arg_0 = var_29; [L361] CALL __VERIFIER_assert(!(bad_30_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 850 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3762 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3762 mSDsluCounter, 28846 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22552 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 6294 mSDtfsCounter, 299 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=871occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 563 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-01-09 06:15:24,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:15:26,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:15:27,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 06:15:27,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:15:27,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:15:27,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:15:27,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:15:27,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:15:27,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:15:27,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:15:27,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:15:27,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:15:27,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:15:27,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:15:27,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:15:27,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:15:27,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:27,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:15:27,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:15:27,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:15:27,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:15:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:27,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:15:27,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:15:27,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:15:27,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:15:27,129 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-jdk21/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 -> 60dab3e2339bce2b045dd3b78258045145cb10b71bd20a1415e48f1177a4dd2d [2025-01-09 06:15:27,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:15:27,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:15:27,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:15:27,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:15:27,419 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:15:27,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2025-01-09 06:15:28,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa87cc6d3/b87978c8a304451288ee841910a2635c/FLAGd584130d2 [2025-01-09 06:15:29,114 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:15:29,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c [2025-01-09 06:15:29,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa87cc6d3/b87978c8a304451288ee841910a2635c/FLAGd584130d2 [2025-01-09 06:15:29,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa87cc6d3/b87978c8a304451288ee841910a2635c [2025-01-09 06:15:29,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:15:29,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:15:29,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:29,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:15:29,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:15:29,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:29" (1/1) ... [2025-01-09 06:15:29,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6ffd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:29, skipping insertion in model container [2025-01-09 06:15:29,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:15:29" (1/1) ... [2025-01-09 06:15:29,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:15:29,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c[1244,1257] [2025-01-09 06:15:29,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:29,799 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:15:29,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.Heap.c[1244,1257] [2025-01-09 06:15:29,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:15:30,008 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:15:30,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30 WrapperNode [2025-01-09 06:15:30,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:15:30,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:30,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:15:30,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:15:30,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,176 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3109 [2025-01-09 06:15:30,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:15:30,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:15:30,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:15:30,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:15:30,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,268 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:15:30,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:15:30,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:15:30,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:15:30,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:15:30,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (1/1) ... [2025-01-09 06:15:30,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:15:30,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:30,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:15:30,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:15:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:15:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 06:15:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 06:15:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:15:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:15:30,881 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:15:30,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:15:32,408 INFO L? ?]: Removed 166 outVars from TransFormulas that were not future-live. [2025-01-09 06:15:32,409 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:15:32,418 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:15:32,419 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:15:32,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:32 BoogieIcfgContainer [2025-01-09 06:15:32,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:15:32,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:15:32,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:15:32,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:15:32,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:15:29" (1/3) ... [2025-01-09 06:15:32,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6349b956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:32, skipping insertion in model container [2025-01-09 06:15:32,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:15:30" (2/3) ... [2025-01-09 06:15:32,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6349b956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:15:32, skipping insertion in model container [2025-01-09 06:15:32,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:15:32" (3/3) ... [2025-01-09 06:15:32,433 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.Heap.c [2025-01-09 06:15:32,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:15:32,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.Heap.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:15:32,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:15:32,510 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;@46a94a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:15:32,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:15:32,515 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-01-09 06:15:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 06:15:32,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:32,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 06:15:32,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 06:15:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:15:32,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717707582] [2025-01-09 06:15:32,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:32,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:15:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:32,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:15:32,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:15:33,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 06:15:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 06:15:33,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:33,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:33,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 06:15:33,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:15:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:15:33,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:15:33,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:15:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717707582] [2025-01-09 06:15:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717707582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:15:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:15:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:15:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446748531] [2025-01-09 06:15:33,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:15:33,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:15:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:15:33,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:15:33,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:15:33,394 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-01-09 06:15:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:15:33,500 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 06:15:33,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:15:33,502 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-01-09 06:15:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:15:33,508 INFO L225 Difference]: With dead ends: 18 [2025-01-09 06:15:33,508 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 06:15:33,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:15:33,514 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:15:33,515 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.1s Time] [2025-01-09 06:15:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 06:15:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 06:15:33,535 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-01-09 06:15:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 06:15:33,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 06:15:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:15:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 06:15:33,539 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-01-09 06:15:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 06:15:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 06:15:33,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:15:33,540 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 06:15:33,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:15:33,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:15:33,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:15:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:15:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 06:15:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:15:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752762603] [2025-01-09 06:15:33,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:15:33,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:15:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:15:33,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:15:33,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:15:34,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 06:15:34,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 06:15:34,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:15:34,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:15:34,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 06:15:34,441 INFO L279 TraceCheckSpWp]: Computing forward predicates...