./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:24:01,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:24:02,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:24:02,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:24:02,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:24:02,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:24:02,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:24:02,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:24:02,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:24:02,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:24:02,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:24:02,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:24:02,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:24:02,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:24:02,055 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:24:02,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:24:02,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:24:02,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:24:02,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:02,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:24:02,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:24:02,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-03-17 04:24:02,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:24:02,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:24:02,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:24:02,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:24:02,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:24:02,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:03,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c972f4dbe/39d2114974f645afb6a705b734acfa5b/FLAGe0c0f767a [2025-03-17 04:24:03,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:24:03,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:03,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c972f4dbe/39d2114974f645afb6a705b734acfa5b/FLAGe0c0f767a [2025-03-17 04:24:03,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c972f4dbe/39d2114974f645afb6a705b734acfa5b [2025-03-17 04:24:03,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:24:03,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:24:03,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:03,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:24:03,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:24:03,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:03" (1/1) ... [2025-03-17 04:24:03,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b56083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:03, skipping insertion in model container [2025-03-17 04:24:03,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:03" (1/1) ... [2025-03-17 04:24:03,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:24:04,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-17 04:24:04,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:04,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:24:04,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-17 04:24:04,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:04,175 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:24:04,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04 WrapperNode [2025-03-17 04:24:04,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:04,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:04,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:24:04,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:24:04,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,205 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-17 04:24:04,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:04,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:24:04,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:24:04,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:24:04,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:24:04,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:24:04,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:24:04,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:24:04,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:24:04,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (1/1) ... [2025-03-17 04:24:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:24:04,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:24:04,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:24:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:24:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:24:04,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:24:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:24:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:24:04,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:24:04,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:24:04,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:24:04,476 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:24:04,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:24:04,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:24:04,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:24:04,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:04 BoogieIcfgContainer [2025-03-17 04:24:04,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:24:04,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:24:04,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:24:04,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:24:04,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:24:03" (1/3) ... [2025-03-17 04:24:04,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fc9dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:04, skipping insertion in model container [2025-03-17 04:24:04,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:04" (2/3) ... [2025-03-17 04:24:04,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fc9dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:04, skipping insertion in model container [2025-03-17 04:24:04,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:04" (3/3) ... [2025-03-17 04:24:04,492 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:04,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:24:04,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:24:04,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:24:04,558 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;@3c7f6122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:24:04,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:24:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:04,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:04,570 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:04,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1131696368, now seen corresponding path program 1 times [2025-03-17 04:24:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:24:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80950252] [2025-03-17 04:24:04,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:24:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:04,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:04,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:04,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 04:24:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:24:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80950252] [2025-03-17 04:24:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80950252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:24:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670337576] [2025-03-17 04:24:04,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:04,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:24:04,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:24:04,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:24:04,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:24:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:04,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:24:04,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 04:24:04,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:24:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670337576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:24:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:24:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346465465] [2025-03-17 04:24:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:24:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:24:04,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:24:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:24:04,917 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:24:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:24:04,931 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2025-03-17 04:24:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:24:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2025-03-17 04:24:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:24:04,936 INFO L225 Difference]: With dead ends: 69 [2025-03-17 04:24:04,936 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 04:24:04,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:24:04,943 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:24:04,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:24:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 04:24:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 04:24:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2025-03-17 04:24:04,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 75 [2025-03-17 04:24:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:24:04,972 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2025-03-17 04:24:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:24:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2025-03-17 04:24:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:04,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:04,974 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:04,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:24:05,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:24:05,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:05,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 680463252, now seen corresponding path program 1 times [2025-03-17 04:24:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:24:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089287154] [2025-03-17 04:24:05,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:24:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:05,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:24:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:24:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089287154] [2025-03-17 04:24:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089287154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:24:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:24:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409523862] [2025-03-17 04:24:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:24:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:24:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:24:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:24:05,855 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:24:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:24:05,916 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-03-17 04:24:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:24:05,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2025-03-17 04:24:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:24:05,918 INFO L225 Difference]: With dead ends: 47 [2025-03-17 04:24:05,918 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 04:24:05,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:24:05,919 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:24:05,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:24:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 04:24:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-17 04:24:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2025-03-17 04:24:05,924 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 75 [2025-03-17 04:24:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:24:05,926 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2025-03-17 04:24:05,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:24:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2025-03-17 04:24:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:05,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:05,928 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:24:05,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 680493043, now seen corresponding path program 1 times [2025-03-17 04:24:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:24:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261780683] [2025-03-17 04:24:05,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:24:05,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:05,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:05,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:24:05,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:24:05,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:05,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:05,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:05,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:24:06,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:24:06,015 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:24:06,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:24:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:24:06,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:24:06,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:24:06,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:24:06 BoogieIcfgContainer [2025-03-17 04:24:06,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:24:06,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:24:06,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:24:06,066 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:24:06,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:04" (3/4) ... [2025-03-17 04:24:06,069 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:24:06,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:24:06,070 INFO L158 Benchmark]: Toolchain (without parser) took 2092.82ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 117.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-17 04:24:06,071 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:06,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.82ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 119.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:24:06,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.36ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 117.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:06,072 INFO L158 Benchmark]: Boogie Preprocessor took 39.89ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:06,073 INFO L158 Benchmark]: IcfgBuilder took 238.12ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 101.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:24:06,073 INFO L158 Benchmark]: TraceAbstraction took 1579.27ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 118.4MB in the end (delta: -17.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:06,073 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:24:06,074 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.24ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.82ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 119.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.36ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 117.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.89ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 238.12ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 101.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1579.27ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 118.4MB in the end (delta: -17.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.4MB in the end (delta: 1.0MB). 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: 19]: 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 someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 31.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 0.25; [L26] float var_1_5 = 10.5; [L27] unsigned char var_1_6 = 16; [L28] double var_1_7 = 10.75; [L29] double var_1_8 = 2.675; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 2; [L73] isInitial = 1 [L74] FCALL initially() [L75] COND TRUE 1 [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L52] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L53] var_1_5 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L54] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L55] var_1_7 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L56] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L57] var_1_8 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L58] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L60] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L62] var_1_10 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L63] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L64] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L64] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L77] RET updateVariables() [L78] CALL step() [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L40] COND FALSE !((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L78] RET step() [L79] CALL, EXPR property() [L69-L70] return (var_1_2 ? (var_1_3 ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) : 1) && (((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_9 - var_1_10))) : 1) ; [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] [L19] reach_error() VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=-129] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 64 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 123 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 95 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 770/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 04:24:06,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:24:08,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:24:08,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:24:08,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:24:08,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:24:08,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:24:08,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:24:08,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:24:08,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:24:08,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:24:08,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:24:08,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:24:08,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:24:08,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:24:08,121 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:24:08,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:24:08,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:24:08,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:24:08,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:08,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:24:08,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:24:08,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:24:08,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:24:08,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:24:08,125 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2025-03-17 04:24:08,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:24:08,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:24:08,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:24:08,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:24:08,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:24:08,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:09,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bffe8b13/e64a3c37ebb7497389e1f08af801e489/FLAG077c2c610 [2025-03-17 04:24:09,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:24:09,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:09,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bffe8b13/e64a3c37ebb7497389e1f08af801e489/FLAG077c2c610 [2025-03-17 04:24:09,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bffe8b13/e64a3c37ebb7497389e1f08af801e489 [2025-03-17 04:24:09,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:24:09,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:24:09,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:09,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:24:09,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:24:09,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:09" (1/1) ... [2025-03-17 04:24:09,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23341fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:09, skipping insertion in model container [2025-03-17 04:24:09,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:24:09" (1/1) ... [2025-03-17 04:24:09,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:24:09,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-17 04:24:09,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:09,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:24:09,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i[915,928] [2025-03-17 04:24:09,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:24:10,000 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:24:10,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10 WrapperNode [2025-03-17 04:24:10,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:24:10,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:10,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:24:10,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:24:10,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,038 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-17 04:24:10,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:24:10,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:24:10,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:24:10,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:24:10,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,060 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:24:10,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:24:10,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:24:10,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:24:10,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:24:10,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (1/1) ... [2025-03-17 04:24:10,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:24:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:24:10,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:24:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:24:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:24:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:24:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:24:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:24:10,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:24:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:24:10,192 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:24:10,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:24:14,104 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 04:24:14,104 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:24:14,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:24:14,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:24:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:14 BoogieIcfgContainer [2025-03-17 04:24:14,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:24:14,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:24:14,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:24:14,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:24:14,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:24:09" (1/3) ... [2025-03-17 04:24:14,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c4c45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:14, skipping insertion in model container [2025-03-17 04:24:14,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:24:10" (2/3) ... [2025-03-17 04:24:14,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c4c45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:24:14, skipping insertion in model container [2025-03-17 04:24:14,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:24:14" (3/3) ... [2025-03-17 04:24:14,122 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2025-03-17 04:24:14,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:24:14,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-71.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:24:14,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:24:14,186 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;@147ccae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:24:14,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:24:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:14,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:14,198 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:14,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:14,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1131696368, now seen corresponding path program 1 times [2025-03-17 04:24:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:24:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700850356] [2025-03-17 04:24:14,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:14,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:14,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:24:14,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:24:14,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 04:24:14,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:14,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:14,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:14,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:14,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:24:14,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 04:24:14,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:24:14,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:24:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700850356] [2025-03-17 04:24:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700850356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:24:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:24:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861263595] [2025-03-17 04:24:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:24:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:24:14,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:24:14,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:24:14,459 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:24:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:24:14,474 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2025-03-17 04:24:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:24:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2025-03-17 04:24:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:24:14,478 INFO L225 Difference]: With dead ends: 69 [2025-03-17 04:24:14,478 INFO L226 Difference]: Without dead ends: 34 [2025-03-17 04:24:14,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:24:14,482 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:24:14,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:24:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-17 04:24:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-17 04:24:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2025-03-17 04:24:14,506 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 75 [2025-03-17 04:24:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:24:14,506 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2025-03-17 04:24:14,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:24:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2025-03-17 04:24:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:14,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:14,509 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:14,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 04:24:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:14,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 680463252, now seen corresponding path program 1 times [2025-03-17 04:24:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:24:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626504533] [2025-03-17 04:24:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:24:14,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:24:14,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 04:24:14,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:14,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:14,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:14,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:14,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:24:14,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:24:23,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:24:23,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:24:23,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626504533] [2025-03-17 04:24:23,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626504533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:23,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:24:23,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:24:23,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865633595] [2025-03-17 04:24:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:23,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:24:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:24:23,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:24:23,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:24:23,077 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:24:25,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:27,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:24:28,466 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-03-17 04:24:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:24:28,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2025-03-17 04:24:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:24:28,467 INFO L225 Difference]: With dead ends: 47 [2025-03-17 04:24:28,467 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 04:24:28,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:24:28,468 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:24:28,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 04:24:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 04:24:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-17 04:24:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:24:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2025-03-17 04:24:28,478 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 75 [2025-03-17 04:24:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:24:28,480 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2025-03-17 04:24:28,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:24:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2025-03-17 04:24:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 04:24:28,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:24:28,484 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:24:28,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 04:24:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:28,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:24:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:24:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash 680493043, now seen corresponding path program 1 times [2025-03-17 04:24:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:24:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949668373] [2025-03-17 04:24:28,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:24:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:24:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:24:28,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:24:28,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 04:24:28,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 04:24:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 04:24:28,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:24:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:24:28,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 04:24:28,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:24:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:24:49,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:24:49,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:24:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949668373] [2025-03-17 04:24:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949668373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:24:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:24:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:24:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21392842] [2025-03-17 04:24:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:24:49,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:24:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:24:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:24:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:24:49,348 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:24:51,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:24:59,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:25:02,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:25:04,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:25:11,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 04:25:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:13,235 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-17 04:25:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2025-03-17 04:25:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:13,251 INFO L225 Difference]: With dead ends: 45 [2025-03-17 04:25:13,251 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 04:25:13,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:13,252 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:13,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 164 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2025-03-17 04:25:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 04:25:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2025-03-17 04:25:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:25:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2025-03-17 04:25:13,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 75 [2025-03-17 04:25:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:13,258 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2025-03-17 04:25:13,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:25:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2025-03-17 04:25:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 04:25:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:13,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:25:13,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 04:25:13,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:25:13,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:13,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash -407226030, now seen corresponding path program 1 times [2025-03-17 04:25:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:25:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432467333] [2025-03-17 04:25:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 04:25:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:25:13,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 04:25:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 04:25:13,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 04:25:13,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 04:25:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:13,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 04:25:13,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:38,448 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 04:25:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:25:47,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:47,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:25:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432467333] [2025-03-17 04:25:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432467333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:47,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:25:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997418119] [2025-03-17 04:25:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:47,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:25:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:25:47,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:25:47,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:47,892 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)