./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:25:29,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:25:29,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:25:29,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:25:29,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:25:29,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:25:29,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:25:29,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:25:29,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:25:29,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:25:29,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:25:29,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:25:29,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:25:29,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:25:29,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:25:29,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:29,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:25:29,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:25:29,405 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-03-17 03:25:29,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:25:29,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:25:29,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:25:29,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:25:29,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:25:29,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:30,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35a7266e/2a7b4b6e845249c5ac8e2575928b97a1/FLAG4818edf4c [2025-03-17 03:25:31,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:25:31,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:31,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35a7266e/2a7b4b6e845249c5ac8e2575928b97a1/FLAG4818edf4c [2025-03-17 03:25:31,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35a7266e/2a7b4b6e845249c5ac8e2575928b97a1 [2025-03-17 03:25:31,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:25:31,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:25:31,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:31,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:25:31,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:25:31,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d15c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31, skipping insertion in model container [2025-03-17 03:25:31,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:25:31,596 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-03-17 03:25:31,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:31,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:25:31,655 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-03-17 03:25:31,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:31,685 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:25:31,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31 WrapperNode [2025-03-17 03:25:31,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:31,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:31,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:25:31,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:25:31,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,712 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-03-17 03:25:31,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:31,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:25:31,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:25:31,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:25:31,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,729 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 03:25:31,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:25:31,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:25:31,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:25:31,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:25:31,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (1/1) ... [2025-03-17 03:25:31,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:31,765 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 03:25:31,768 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 03:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:25:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:25:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:25:31,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:25:31,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:25:32,001 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1; [2025-03-17 03:25:32,021 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:25:32,021 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:25:32,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:25:32,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:25:32,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:32 BoogieIcfgContainer [2025-03-17 03:25:32,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:25:32,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:25:32,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:25:32,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:25:32,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:25:31" (1/3) ... [2025-03-17 03:25:32,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f045f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:32, skipping insertion in model container [2025-03-17 03:25:32,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:31" (2/3) ... [2025-03-17 03:25:32,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f045f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:32, skipping insertion in model container [2025-03-17 03:25:32,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:32" (3/3) ... [2025-03-17 03:25:32,047 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:32,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:25:32,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:25:32,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:25:32,104 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;@49505ffe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:25:32,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:25:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:25:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:25:32,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:32,116 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:32,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:32,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -932641390, now seen corresponding path program 1 times [2025-03-17 03:25:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468971463] [2025-03-17 03:25:32,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:32,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:25:32,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:25:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:25:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:32,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468971463] [2025-03-17 03:25:32,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468971463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:25:32,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432620315] [2025-03-17 03:25:32,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:32,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:25:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:32,328 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 03:25:32,330 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 03:25:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:25:32,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:25:32,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:32,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:25:32,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:25:32,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432620315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:25:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:25:32,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278819732] [2025-03-17 03:25:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:25:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:32,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:25:32,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:25:32,469 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:25:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:32,488 INFO L93 Difference]: Finished difference Result 111 states and 185 transitions. [2025-03-17 03:25:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:25:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-17 03:25:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:32,495 INFO L225 Difference]: With dead ends: 111 [2025-03-17 03:25:32,495 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 03:25:32,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 03:25:32,499 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:32,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 03:25:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 03:25:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:25:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2025-03-17 03:25:32,540 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 103 [2025-03-17 03:25:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:32,540 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2025-03-17 03:25:32,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:25:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2025-03-17 03:25:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 03:25:32,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:32,546 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:32,552 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 03:25:32,746 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 03:25:32,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1364552622, now seen corresponding path program 1 times [2025-03-17 03:25:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294400012] [2025-03-17 03:25:32,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:32,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 03:25:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 03:25:32,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:32,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:25:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294400012] [2025-03-17 03:25:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294400012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:33,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:25:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871207304] [2025-03-17 03:25:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:25:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:33,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:25:33,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:25:33,082 INFO L87 Difference]: Start difference. First operand 54 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:33,249 INFO L93 Difference]: Finished difference Result 161 states and 242 transitions. [2025-03-17 03:25:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:25:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-17 03:25:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:33,252 INFO L225 Difference]: With dead ends: 161 [2025-03-17 03:25:33,252 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 03:25:33,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:25:33,253 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 59 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:33,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:25:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 03:25:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2025-03-17 03:25:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:25:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-03-17 03:25:33,281 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 103 [2025-03-17 03:25:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:33,282 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-03-17 03:25:33,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-03-17 03:25:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 03:25:33,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:33,283 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:33,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:25:33,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:33,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash -609263976, now seen corresponding path program 1 times [2025-03-17 03:25:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737636912] [2025-03-17 03:25:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:33,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 03:25:33,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 03:25:33,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:33,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:25:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737636912] [2025-03-17 03:25:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737636912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:25:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425349201] [2025-03-17 03:25:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:25:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:33,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:25:33,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:25:33,560 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:33,624 INFO L93 Difference]: Finished difference Result 183 states and 272 transitions. [2025-03-17 03:25:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:25:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-17 03:25:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:33,626 INFO L225 Difference]: With dead ends: 183 [2025-03-17 03:25:33,626 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 03:25:33,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:25:33,627 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:33,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 203 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 03:25:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2025-03-17 03:25:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:25:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2025-03-17 03:25:33,639 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 107 [2025-03-17 03:25:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:33,639 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2025-03-17 03:25:33,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2025-03-17 03:25:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 03:25:33,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:33,640 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:25:33,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2116727638, now seen corresponding path program 1 times [2025-03-17 03:25:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778104443] [2025-03-17 03:25:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:33,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 03:25:33,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 03:25:33,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:33,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:25:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:25:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778104443] [2025-03-17 03:25:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778104443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:34,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:34,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:25:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637752355] [2025-03-17 03:25:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:34,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:25:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:25:34,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:25:34,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:25:34,115 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:34,282 INFO L93 Difference]: Finished difference Result 187 states and 272 transitions. [2025-03-17 03:25:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:25:34,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2025-03-17 03:25:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:34,286 INFO L225 Difference]: With dead ends: 187 [2025-03-17 03:25:34,286 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 03:25:34,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:25:34,287 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:34,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 187 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:25:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 03:25:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2025-03-17 03:25:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:25:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 03:25:34,310 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 108 [2025-03-17 03:25:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 03:25:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 03:25:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 03:25:34,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:34,311 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:25:34,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 627696557, now seen corresponding path program 1 times [2025-03-17 03:25:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:25:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135887636] [2025-03-17 03:25:34,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:25:34,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:25:34,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:25:34,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:34,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:25:34,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530225510] [2025-03-17 03:25:34,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:34,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:25:34,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:34,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:25:34,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:25:34,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:25:34,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:25:34,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:34,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:25:34,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:25:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 03:25:34,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 03:25:34,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:34,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:25:34,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:25:34,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:25:34,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:25:34,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:25:34,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:25:34,719 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:25:34,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:25:34,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:25:34 BoogieIcfgContainer [2025-03-17 03:25:34,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:25:34,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:25:34,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:25:34,770 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:25:34,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:32" (3/4) ... [2025-03-17 03:25:34,773 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:25:34,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:25:34,774 INFO L158 Benchmark]: Toolchain (without parser) took 3298.50ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 77.6MB in the end (delta: 29.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-17 03:25:34,774 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:34,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.02ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:25:34,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.62ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:25:34,774 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:34,775 INFO L158 Benchmark]: IcfgBuilder took 297.77ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 71.9MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:25:34,775 INFO L158 Benchmark]: TraceAbstraction took 2728.29ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 77.7MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:34,775 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:25:34,780 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.30ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.02ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 94.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.62ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 297.77ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 71.9MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2728.29ms. Allocated memory is still 142.6MB. Free memory was 71.5MB in the beginning and 77.7MB in the end (delta: -6.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 41.6kB). 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 58, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of bitwiseOr at line 39, overapproximation of bitwiseOr at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=256, var_1_7=16383, var_1_8=16383] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=256, var_1_10=256, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=256, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=256, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=256, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=94, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=256, var_1_7=16383, var_1_8=16383, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 664 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 277 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 1214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2370/2400 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 03:25:34,795 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_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:25:36,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:25:36,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:25:36,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:25:36,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:25:36,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:25:36,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:25:36,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:25:36,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:25:36,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:25:36,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:25:36,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:25:36,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:25:36,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:25:36,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:25:36,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:36,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:25:36,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:25:36,807 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2025-03-17 03:25:37,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:25:37,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:25:37,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:25:37,094 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:25:37,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:25:37,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:38,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6b86d18/f1fc78b2047a4d2fb1f128fdbc06027d/FLAGde7732e0d [2025-03-17 03:25:38,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:25:38,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:38,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6b86d18/f1fc78b2047a4d2fb1f128fdbc06027d/FLAGde7732e0d [2025-03-17 03:25:38,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af6b86d18/f1fc78b2047a4d2fb1f128fdbc06027d [2025-03-17 03:25:38,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:25:38,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:25:38,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:38,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:25:38,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:25:38,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb27fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38, skipping insertion in model container [2025-03-17 03:25:38,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:25:38,819 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-03-17 03:25:38,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:38,881 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:25:38,890 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_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2025-03-17 03:25:38,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:25:38,932 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:25:38,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38 WrapperNode [2025-03-17 03:25:38,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:25:38,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:38,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:25:38,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:25:38,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,972 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 03:25:38,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:25:38,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:25:38,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:25:38,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:25:38,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:38,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,000 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 03:25:39,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:25:39,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:25:39,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:25:39,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:25:39,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (1/1) ... [2025-03-17 03:25:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:25:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:25:39,054 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 03:25:39,057 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 03:25:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:25:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:25:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:25:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:25:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:25:39,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:25:39,143 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:25:39,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:25:39,441 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:25:39,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:25:39,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:25:39,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:25:39,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:39 BoogieIcfgContainer [2025-03-17 03:25:39,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:25:39,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:25:39,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:25:39,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:25:39,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:25:38" (1/3) ... [2025-03-17 03:25:39,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1537988a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:39, skipping insertion in model container [2025-03-17 03:25:39,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:38" (2/3) ... [2025-03-17 03:25:39,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1537988a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:39, skipping insertion in model container [2025-03-17 03:25:39,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:25:39" (3/3) ... [2025-03-17 03:25:39,466 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2025-03-17 03:25:39,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:25:39,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:25:39,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:25:39,551 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;@75eca64d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:25:39,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:25:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:25:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:25:39,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:39,568 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:39,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -832765068, now seen corresponding path program 1 times [2025-03-17 03:25:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698806924] [2025-03-17 03:25:39,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:39,589 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 03:25:39,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:39,595 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 03:25:39,597 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 03:25:39,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:25:39,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:25:39,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:39,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:25:39,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 03:25:39,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:39,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:39,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698806924] [2025-03-17 03:25:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698806924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:39,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:25:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451829682] [2025-03-17 03:25:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:39,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:25:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:25:39,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:25:39,845 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:39,865 INFO L93 Difference]: Finished difference Result 89 states and 151 transitions. [2025-03-17 03:25:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:25:39,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2025-03-17 03:25:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:39,873 INFO L225 Difference]: With dead ends: 89 [2025-03-17 03:25:39,873 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 03:25:39,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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 03:25:39,882 INFO L435 NwaCegarLoop]: 66 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, 66 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 03:25:39,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:25:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 03:25:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 03:25:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 03:25:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2025-03-17 03:25:39,948 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2025-03-17 03:25:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:39,948 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2025-03-17 03:25:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2025-03-17 03:25:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 03:25:39,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:39,954 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:39,972 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 03:25:40,159 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 03:25:40,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash -678609740, now seen corresponding path program 1 times [2025-03-17 03:25:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213618038] [2025-03-17 03:25:40,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:40,161 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 03:25:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:40,163 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 03:25:40,164 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 03:25:40,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 03:25:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 03:25:40,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:40,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:25:40,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:25:41,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:41,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213618038] [2025-03-17 03:25:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213618038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:25:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069412029] [2025-03-17 03:25:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:41,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:25:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:41,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:25:41,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:25:41,088 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:41,443 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2025-03-17 03:25:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:25:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2025-03-17 03:25:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:41,446 INFO L225 Difference]: With dead ends: 128 [2025-03-17 03:25:41,448 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:25:41,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:25:41,449 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:41,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 192 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:25:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:25:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2025-03-17 03:25:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 03:25:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2025-03-17 03:25:41,474 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 98 [2025-03-17 03:25:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:41,475 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2025-03-17 03:25:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2025-03-17 03:25:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:25:41,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:41,477 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:41,488 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 03:25:41,681 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 03:25:41,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2058843698, now seen corresponding path program 1 times [2025-03-17 03:25:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053125528] [2025-03-17 03:25:41,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:41,683 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 03:25:41,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:41,685 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 03:25:41,686 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 03:25:41,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:25:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:25:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:41,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:25:41,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-17 03:25:42,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:25:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 03:25:43,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053125528] [2025-03-17 03:25:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053125528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:25:43,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:25:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 03:25:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578712860] [2025-03-17 03:25:43,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:25:43,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:25:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:43,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:25:43,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:25:43,238 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 03:25:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:44,258 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2025-03-17 03:25:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:25:44,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 99 [2025-03-17 03:25:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:44,261 INFO L225 Difference]: With dead ends: 181 [2025-03-17 03:25:44,261 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 03:25:44,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:25:44,262 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 132 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:44,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 171 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:25:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 03:25:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2025-03-17 03:25:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:25:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2025-03-17 03:25:44,277 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 99 [2025-03-17 03:25:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:44,277 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2025-03-17 03:25:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 03:25:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2025-03-17 03:25:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 03:25:44,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:44,278 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:44,284 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 03:25:44,479 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 03:25:44,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -316033363, now seen corresponding path program 1 times [2025-03-17 03:25:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:44,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461795650] [2025-03-17 03:25:44,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:44,480 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 03:25:44,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:44,482 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 03:25:44,484 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 03:25:44,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 03:25:44,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 03:25:44,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:44,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:44,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:25:44,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 03:25:51,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:25:51,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461795650] [2025-03-17 03:25:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461795650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:25:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:25:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:25:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305998361] [2025-03-17 03:25:51,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:25:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:25:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:51,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:25:51,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:25:51,615 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:52,313 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2025-03-17 03:25:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:25:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2025-03-17 03:25:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:52,319 INFO L225 Difference]: With dead ends: 150 [2025-03-17 03:25:52,319 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 03:25:52,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:25:52,320 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:52,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 285 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:25:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 03:25:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2025-03-17 03:25:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:25:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2025-03-17 03:25:52,337 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 99 [2025-03-17 03:25:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:52,337 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2025-03-17 03:25:52,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 03:25:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2025-03-17 03:25:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:25:52,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:52,338 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:52,344 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 (5)] Ended with exit code 0 [2025-03-17 03:25:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 03:25:52,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 601310070, now seen corresponding path program 1 times [2025-03-17 03:25:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892995922] [2025-03-17 03:25:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:52,540 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 03:25:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:52,542 INFO L229 MonitoredProcess]: Starting monitored process 6 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 03:25:52,543 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 (6)] Waiting until timeout for monitored process [2025-03-17 03:25:52,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:25:52,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:25:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:52,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:25:52,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:25:52,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:25:53,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:25:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892995922] [2025-03-17 03:25:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892995922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:25:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1656552245] [2025-03-17 03:25:53,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:53,229 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 03:25:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 03:25:53,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 03:25:53,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 03:25:53,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:25:53,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:25:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:53,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:25:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:25:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:25:53,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:25:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1656552245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:25:54,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:25:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 03:25:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049692325] [2025-03-17 03:25:54,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:25:54,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:25:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:25:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:25:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:25:54,114 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:25:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:25:54,615 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2025-03-17 03:25:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:25:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-17 03:25:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:25:54,623 INFO L225 Difference]: With dead ends: 218 [2025-03-17 03:25:54,623 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 03:25:54,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:25:54,624 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:25:54,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 204 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:25:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 03:25:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2025-03-17 03:25:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 03:25:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2025-03-17 03:25:54,659 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 100 [2025-03-17 03:25:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:25:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2025-03-17 03:25:54,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 03:25:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2025-03-17 03:25:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 03:25:54,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:25:54,661 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:25:54,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 03:25:54,868 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 (6)] Ended with exit code 0 [2025-03-17 03:25:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 03:25:55,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:25:55,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:25:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 601339861, now seen corresponding path program 1 times [2025-03-17 03:25:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:25:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978564154] [2025-03-17 03:25:55,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:25:55,063 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 03:25:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:25:55,065 INFO L229 MonitoredProcess]: Starting monitored process 8 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 03:25:55,067 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 (8)] Waiting until timeout for monitored process [2025-03-17 03:25:55,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 03:25:55,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 03:25:55,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:25:55,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:25:55,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 03:25:55,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:26:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-17 03:26:01,586 INFO L312 TraceCheckSpWp]: Computing backward predicates...