./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:55:03,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:55:03,864 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:55:03,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:55:03,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:55:03,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:55:03,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:55:03,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:55:03,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:55:03,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:55:03,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:55:03,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:55:03,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:55:03,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:55:03,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:55:03,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:55:03,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:03,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:55:03,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:03,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:55:03,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:55:03,897 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2025-01-09 06:55:04,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:55:04,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:55:04,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:55:04,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:55:04,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:55:04,195 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.cal57.c [2025-01-09 06:55:05,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c599e78/12f99d0c183b4164802a2192db884d0d/FLAG5bf5ec688 [2025-01-09 06:55:05,680 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:55:05,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2025-01-09 06:55:05,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c599e78/12f99d0c183b4164802a2192db884d0d/FLAG5bf5ec688 [2025-01-09 06:55:05,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c599e78/12f99d0c183b4164802a2192db884d0d [2025-01-09 06:55:05,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:55:05,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:55:05,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:55:05,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:55:05,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:55:05,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:05" (1/1) ... [2025-01-09 06:55:05,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:05, skipping insertion in model container [2025-01-09 06:55:05,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:05" (1/1) ... [2025-01-09 06:55:05,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:55:06,069 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.cal57.c[1245,1258] [2025-01-09 06:55:06,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:55:06,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:55:06,116 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.cal57.c[1245,1258] [2025-01-09 06:55:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:55:06,152 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:55:06,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06 WrapperNode [2025-01-09 06:55:06,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:55:06,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:55:06,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:55:06,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:55:06,158 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:55:06" (1/1) ... [2025-01-09 06:55:06,165 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:55:06" (1/1) ... [2025-01-09 06:55:06,199 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2025-01-09 06:55:06,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:55:06,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:55:06,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:55:06,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:55:06,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,227 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:55:06,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:55:06,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:55:06,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:55:06,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:55:06,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (1/1) ... [2025-01-09 06:55:06,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:06,280 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:55:06,282 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:55:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:55:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:55:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 06:55:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:55:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:55:06,364 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:55:06,366 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:55:06,826 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-01-09 06:55:06,827 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:55:06,840 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:55:06,845 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:55:06,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:06 BoogieIcfgContainer [2025-01-09 06:55:06,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:55:06,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:55:06,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:55:06,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:55:06,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:55:05" (1/3) ... [2025-01-09 06:55:06,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7daf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:06, skipping insertion in model container [2025-01-09 06:55:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:06" (2/3) ... [2025-01-09 06:55:06,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7daf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:06, skipping insertion in model container [2025-01-09 06:55:06,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:06" (3/3) ... [2025-01-09 06:55:06,863 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2025-01-09 06:55:06,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:55:06,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal57.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:55:06,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:55:06,933 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;@6a0720fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:55:06,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:55:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 06:55:06,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:06,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:55:06,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2017394231, now seen corresponding path program 1 times [2025-01-09 06:55:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-01-09 06:55:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 06:55:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 06:55:07,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:07,464 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:55:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:55:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-01-09 06:55:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568286473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:55:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711701086] [2025-01-09 06:55:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:07,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:55:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:55:07,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:55:07,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:55:07,485 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:07,513 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2025-01-09 06:55:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:55:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 06:55:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:07,520 INFO L225 Difference]: With dead ends: 113 [2025-01-09 06:55:07,520 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 06:55:07,525 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:55:07,527 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 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:55:07,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:55:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 06:55:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 06:55:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-01-09 06:55:07,552 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 27 [2025-01-09 06:55:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:07,552 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-01-09 06:55:07,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-01-09 06:55:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 06:55:07,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:07,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:55:07,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:55:07,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:07,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1883592983, now seen corresponding path program 1 times [2025-01-09 06:55:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762133460] [2025-01-09 06:55:07,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:07,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 06:55:07,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 06:55:07,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:07,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:07,740 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:55:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:55:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762133460] [2025-01-09 06:55:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762133460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:55:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814007016] [2025-01-09 06:55:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:55:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:55:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:55:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:55:07,743 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:55:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:07,777 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2025-01-09 06:55:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:55:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-01-09 06:55:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:07,783 INFO L225 Difference]: With dead ends: 114 [2025-01-09 06:55:07,783 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 06:55:07,783 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:55:07,784 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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:55:07,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:55:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 06:55:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 06:55:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-01-09 06:55:07,792 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 28 [2025-01-09 06:55:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-01-09 06:55:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:55:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-01-09 06:55:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 06:55:07,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:07,793 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] [2025-01-09 06:55:07,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:55:07,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 640193872, now seen corresponding path program 1 times [2025-01-09 06:55:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549139837] [2025-01-09 06:55:07,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:07,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 06:55:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 06:55:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:08,080 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:55:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:55:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549139837] [2025-01-09 06:55:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549139837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:08,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:55:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368795603] [2025-01-09 06:55:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:08,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:55:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:55:08,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:55:08,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:55:08,082 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:55:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:08,169 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2025-01-09 06:55:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:55:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2025-01-09 06:55:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:08,171 INFO L225 Difference]: With dead ends: 153 [2025-01-09 06:55:08,171 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 06:55:08,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:55:08,172 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 179 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:08,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:55:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 06:55:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2025-01-09 06:55:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 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:55:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2025-01-09 06:55:08,182 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 29 [2025-01-09 06:55:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:08,182 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2025-01-09 06:55:08,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:55:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2025-01-09 06:55:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:55:08,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:08,183 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] [2025-01-09 06:55:08,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:55:08,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:08,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -719939504, now seen corresponding path program 1 times [2025-01-09 06:55:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592195320] [2025-01-09 06:55:08,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:55:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:55:08,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:08,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:08,404 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:55:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:55:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592195320] [2025-01-09 06:55:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592195320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 06:55:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085822047] [2025-01-09 06:55:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 06:55:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:55:08,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 06:55:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:55:08,409 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:55:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:08,533 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2025-01-09 06:55:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:55:08,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2025-01-09 06:55:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:08,535 INFO L225 Difference]: With dead ends: 155 [2025-01-09 06:55:08,535 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 06:55:08,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:55:08,536 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 182 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:08,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 476 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:55:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 06:55:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2025-01-09 06:55:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:55:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2025-01-09 06:55:08,541 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 30 [2025-01-09 06:55:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:08,541 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2025-01-09 06:55:08,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:55:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2025-01-09 06:55:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 06:55:08,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:08,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:55:08,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:55:08,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:08,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash -523941715, now seen corresponding path program 1 times [2025-01-09 06:55:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591858246] [2025-01-09 06:55:08,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 06:55:08,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 06:55:08,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:08,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:09,148 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:55:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:55:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591858246] [2025-01-09 06:55:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591858246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:09,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 06:55:09,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633002895] [2025-01-09 06:55:09,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:09,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 06:55:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:55:09,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 06:55:09,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:55:09,150 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:09,297 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2025-01-09 06:55:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:55:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 06:55:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:09,298 INFO L225 Difference]: With dead ends: 155 [2025-01-09 06:55:09,298 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 06:55:09,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:55:09,299 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 177 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:09,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 458 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:55:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 06:55:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2025-01-09 06:55:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 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:55:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2025-01-09 06:55:09,304 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 31 [2025-01-09 06:55:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:09,305 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2025-01-09 06:55:09,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2025-01-09 06:55:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 06:55:09,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:09,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:55:09,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:55:09,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:09,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1792746033, now seen corresponding path program 1 times [2025-01-09 06:55:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:55:09,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815392789] [2025-01-09 06:55:09,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:55:09,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 06:55:09,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 06:55:09,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:09,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:55:09,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 06:55:09,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 06:55:09,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 06:55:09,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:09,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 06:55:09,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 06:55:09,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 06:55:09,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 06:55:09,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:55:09,413 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 06:55:09,443 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:55:09,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:55:09 BoogieIcfgContainer [2025-01-09 06:55:09,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:55:09,448 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:55:09,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:55:09,448 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:55:09,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:06" (3/4) ... [2025-01-09 06:55:09,450 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 06:55:09,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:55:09,453 INFO L158 Benchmark]: Toolchain (without parser) took 3495.24ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.9MB in the beginning and 175.2MB in the end (delta: -69.3MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2025-01-09 06:55:09,453 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:55:09,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.72ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:55:09,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.39ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 85.0MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 06:55:09,454 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 81.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:55:09,455 INFO L158 Benchmark]: RCFGBuilder took 597.78ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 44.4MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 06:55:09,455 INFO L158 Benchmark]: TraceAbstraction took 2597.16ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 44.4MB in the beginning and 175.2MB in the end (delta: -130.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-01-09 06:55:09,455 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 310.4MB. Free memory was 175.2MB in the beginning and 175.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:55:09,457 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.45ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.72ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.39ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 85.0MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 81.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 597.78ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 44.4MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2597.16ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 44.4MB in the beginning and 175.2MB in the end (delta: -130.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 310.4MB. Free memory was 175.2MB in the beginning and 175.2MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1778 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1363 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 415 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 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:55:09,484 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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:55:11,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:55:11,552 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:55:11,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:55:11,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:55:11,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:55:11,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:55:11,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:55:11,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:55:11,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:55:11,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:55:11,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:55:11,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:55:11,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:55:11,589 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:55:11,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:55:11,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:11,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:55:11,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:55:11,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:55:11,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:11,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:55:11,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:55:11,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:55:11,592 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2025-01-09 06:55:11,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:55:11,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:55:11,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:55:11,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:55:11,868 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:55:11,869 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.cal57.c [2025-01-09 06:55:13,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1097bb55/3815b707c5004975b07514e062ee6627/FLAG761b0e1ba [2025-01-09 06:55:13,264 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:55:13,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2025-01-09 06:55:13,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1097bb55/3815b707c5004975b07514e062ee6627/FLAG761b0e1ba [2025-01-09 06:55:13,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1097bb55/3815b707c5004975b07514e062ee6627 [2025-01-09 06:55:13,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:55:13,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:55:13,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:55:13,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:55:13,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:55:13,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b5c461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13, skipping insertion in model container [2025-01-09 06:55:13,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:55:13,420 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.cal57.c[1245,1258] [2025-01-09 06:55:13,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:55:13,489 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:55:13,499 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.cal57.c[1245,1258] [2025-01-09 06:55:13,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:55:13,549 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:55:13,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13 WrapperNode [2025-01-09 06:55:13,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:55:13,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:55:13,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:55:13,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:55:13,557 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:55:13" (1/1) ... [2025-01-09 06:55:13,566 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:55:13" (1/1) ... [2025-01-09 06:55:13,583 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2025-01-09 06:55:13,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:55:13,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:55:13,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:55:13,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:55:13,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,607 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 06:55:13,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:55:13,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:55:13,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:55:13,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:55:13,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (1/1) ... [2025-01-09 06:55:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:55:13,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:13,664 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:55:13,667 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:55:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:55:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 06:55:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 06:55:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:55:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:55:13,776 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:55:13,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:55:13,974 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-01-09 06:55:13,974 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:55:13,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:55:13,984 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:55:13,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:13 BoogieIcfgContainer [2025-01-09 06:55:13,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:55:13,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:55:13,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:55:13,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:55:13,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:55:13" (1/3) ... [2025-01-09 06:55:13,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:13, skipping insertion in model container [2025-01-09 06:55:13,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:55:13" (2/3) ... [2025-01-09 06:55:13,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:13, skipping insertion in model container [2025-01-09 06:55:13,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:13" (3/3) ... [2025-01-09 06:55:13,992 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2025-01-09 06:55:14,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:55:14,003 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal57.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:55:14,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:55:14,043 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;@274a5a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:55:14,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:55:14,046 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:55:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 06:55:14,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:14,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 06:55:14,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 06:55:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:55:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229615011] [2025-01-09 06:55:14,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:14,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:14,072 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:55:14,088 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:55:14,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 06:55:14,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 06:55:14,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:14,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:14,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 06:55:14,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:55:14,353 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:55:14,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:55:14,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:55:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229615011] [2025-01-09 06:55:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229615011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:55:14,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:55:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:55:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879720392] [2025-01-09 06:55:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:55:14,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:55:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:55:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:55:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:55:14,370 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:55:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:14,401 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 06:55:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:55:14,407 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:55:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:14,411 INFO L225 Difference]: With dead ends: 18 [2025-01-09 06:55:14,411 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 06:55:14,413 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:55:14,415 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:14,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:55:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 06:55:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 06:55:14,431 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:55:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 06:55:14,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 06:55:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:14,434 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 06:55:14,434 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:55:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 06:55:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 06:55:14,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:14,434 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 06:55:14,441 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:55:14,635 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:55:14,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 06:55:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:55:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783110637] [2025-01-09 06:55:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:55:14,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:14,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:14,641 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:55:14,642 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:55:14,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 06:55:14,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 06:55:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:55:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:14,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 06:55:14,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:55:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:55:14,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:55:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:55:16,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:55:16,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783110637] [2025-01-09 06:55:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783110637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:55:16,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:55:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 06:55:16,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517252727] [2025-01-09 06:55:16,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 06:55:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:55:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:55:16,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:55:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:55:16,444 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:16,521 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-01-09 06:55:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:55:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 06:55:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:16,522 INFO L225 Difference]: With dead ends: 14 [2025-01-09 06:55:16,522 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 06:55:16,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:55:16,523 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:16,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:55:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 06:55:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 06:55:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-01-09 06:55:16,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-01-09 06:55:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:16,525 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-01-09 06:55:16,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-01-09 06:55:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 06:55:16,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:16,526 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-09 06:55:16,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:55:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:16,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2025-01-09 06:55:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:55:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404348152] [2025-01-09 06:55:16,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:55:16,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:16,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:16,731 INFO L229 MonitoredProcess]: Starting monitored process 4 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:55:16,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:55:16,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 06:55:16,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 06:55:16,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:55:16,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:16,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 06:55:16,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:55:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:55:17,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:55:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:55:36,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:55:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404348152] [2025-01-09 06:55:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404348152] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:55:36,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:55:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-01-09 06:55:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068141278] [2025-01-09 06:55:36,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 06:55:36,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 06:55:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:55:36,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 06:55:36,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:55:36,124 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:55:36,325 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-01-09 06:55:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:55:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 06:55:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:55:36,326 INFO L225 Difference]: With dead ends: 17 [2025-01-09 06:55:36,326 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 06:55:36,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 06:55:36,326 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:55:36,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:55:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 06:55:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 06:55:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-01-09 06:55:36,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-01-09 06:55:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:55:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-01-09 06:55:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:55:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-01-09 06:55:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 06:55:36,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:55:36,330 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-01-09 06:55:36,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 06:55:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:36,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:55:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:55:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2025-01-09 06:55:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 06:55:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116101098] [2025-01-09 06:55:36,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 06:55:36,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:55:36,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:55:36,534 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:36,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:55:36,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-01-09 06:55:36,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 14 statements. [2025-01-09 06:55:36,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 06:55:36,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:55:36,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 06:55:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:55:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:55:37,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:56:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:56:20,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 06:56:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116101098] [2025-01-09 06:56:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116101098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:56:20,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:56:20,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-01-09 06:56:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338680502] [2025-01-09 06:56:20,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 06:56:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 06:56:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 06:56:20,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 06:56:20,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:56:20,756 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:56:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:56:20,931 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-01-09 06:56:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:56:20,932 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 06:56:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:56:20,932 INFO L225 Difference]: With dead ends: 15 [2025-01-09 06:56:20,932 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 06:56:20,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 06:56:20,934 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:56:20,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:56:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 06:56:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 06:56:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:56:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 06:56:20,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-01-09 06:56:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:56:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 06:56:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:56:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 06:56:20,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 06:56:20,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 06:56:20,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 06:56:21,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:56:21,146 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 06:56:21,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 06:56:21,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 06:56:21,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 06:56:21,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 06:56:21,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-01-09 06:56:21,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:56:21 BoogieIcfgContainer [2025-01-09 06:56:21,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 06:56:21,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 06:56:21,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 06:56:21,410 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 06:56:21,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:13" (3/4) ... [2025-01-09 06:56:21,413 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 06:56:21,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 06:56:21,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 06:56:21,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 06:56:21,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 06:56:21,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 06:56:21,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 06:56:21,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 06:56:21,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 06:56:21,486 INFO L158 Benchmark]: Toolchain (without parser) took 68195.61ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 92.4MB in the beginning and 958.2MB in the end (delta: -865.9MB). Peak memory consumption was 454.8MB. Max. memory is 16.1GB. [2025-01-09 06:56:21,486 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:56:21,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.24ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:56:21,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.94ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:56:21,486 INFO L158 Benchmark]: Boogie Preprocessor took 50.59ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:56:21,487 INFO L158 Benchmark]: RCFGBuilder took 349.40ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 54.2MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 06:56:21,487 INFO L158 Benchmark]: TraceAbstraction took 67418.32ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 53.6MB in the beginning and 966.6MB in the end (delta: -913.0MB). Peak memory consumption was 412.8MB. Max. memory is 16.1GB. [2025-01-09 06:56:21,487 INFO L158 Benchmark]: Witness Printer took 80.00ms. Allocated memory is still 1.4GB. Free memory was 966.6MB in the beginning and 958.2MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 06:56:21,488 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.21ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.24ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.94ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.59ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.40ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 54.2MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67418.32ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 53.6MB in the beginning and 966.6MB in the end (delta: -913.0MB). Peak memory consumption was 412.8MB. Max. memory is 16.1GB. * Witness Printer took 80.00ms. Allocated memory is still 1.4GB. Free memory was 966.6MB in the beginning and 958.2MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.1s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 15 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 65.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 27 QuantifiedInterpolants, 112744 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((((0 == var_15) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == state_18)) && (1 == var_31)) && (1 == var_21)) || ((((((((0 == state_18) && (0 == var_15)) && (0 == state_12)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == var_31)) && (1 == var_21))) || ((((((((0 == state_18) && (0 == var_15)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == var_31)) && (1 == var_21))) RESULT: Ultimate proved your program to be correct! [2025-01-09 06:56:21,527 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 Writing output log to file Ultimate.log Result: TRUE