./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-76.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 709453c15b134f79f9a4611d8c8b0ef9c4b2e09dcca78e096999d06822ec2635 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:12,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:12,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:13:12,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:12,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:12,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:12,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:12,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:12,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:12,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:12,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:12,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:12,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:12,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:12,610 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:12,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:12,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:12,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:12,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:12,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:12,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:12,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:12,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:12,612 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 -> 709453c15b134f79f9a4611d8c8b0ef9c4b2e09dcca78e096999d06822ec2635 [2025-03-03 23:13:12,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:12,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:12,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:12,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:12,839 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:12,841 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-76.i [2025-03-03 23:13:13,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e253cd559/b07be6d8e4694ef7b948dea3c682ba2a/FLAG48b4fc08d [2025-03-03 23:13:14,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:14,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-76.i [2025-03-03 23:13:14,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e253cd559/b07be6d8e4694ef7b948dea3c682ba2a/FLAG48b4fc08d [2025-03-03 23:13:14,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e253cd559/b07be6d8e4694ef7b948dea3c682ba2a [2025-03-03 23:13:14,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:14,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:14,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:14,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:14,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:14,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f596780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14, skipping insertion in model container [2025-03-03 23:13:14,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:14,704 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-76.i[915,928] [2025-03-03 23:13:14,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:14,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:14,764 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-76.i[915,928] [2025-03-03 23:13:14,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:14,803 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:14,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14 WrapperNode [2025-03-03 23:13:14,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:14,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:14,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:14,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:14,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,838 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-03 23:13:14,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:14,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:14,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:14,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:14,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,870 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-03 23:13:14,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:14,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:14,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:14,889 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:14,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (1/1) ... [2025-03-03 23:13:14,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:14,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:14,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:14,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:14,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:13:14,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:14,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:14,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:14,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:15,149 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:15,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:15,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:15,158 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:15,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:15 BoogieIcfgContainer [2025-03-03 23:13:15,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:15,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:15,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:15,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:15,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:14" (1/3) ... [2025-03-03 23:13:15,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add5943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:15, skipping insertion in model container [2025-03-03 23:13:15,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:14" (2/3) ... [2025-03-03 23:13:15,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5add5943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:15, skipping insertion in model container [2025-03-03 23:13:15,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:15" (3/3) ... [2025-03-03 23:13:15,165 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-76.i [2025-03-03 23:13:15,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:15,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-76.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:15,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:15,230 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;@51f955f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:15,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:13:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:15,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:15,241 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:15,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 172922931, now seen corresponding path program 1 times [2025-03-03 23:13:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:15,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281544581] [2025-03-03 23:13:15,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:15,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 23:13:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:13:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281544581] [2025-03-03 23:13:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281544581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:13:15,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584367775] [2025-03-03 23:13:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:15,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:13:15,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:15,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:13:15,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:13:15,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:15,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:15,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:15,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:15,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 23:13:15,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584367775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:13:15,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:13:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062396141] [2025-03-03 23:13:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:13:15,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:15,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:15,603 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 23:13:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:15,619 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2025-03-03 23:13:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:15,620 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-03 23:13:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:15,626 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:13:15,626 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:13:15,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-03 23:13:15,632 INFO L435 NwaCegarLoop]: 52 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, 52 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-03 23:13:15,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:13:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:13:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:13:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:13:15,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2025-03-03 23:13:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:15,666 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:13:15,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 23:13:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:13:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:15,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:15,670 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:15,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:13:15,870 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-03 23:13:15,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1257729525, now seen corresponding path program 1 times [2025-03-03 23:13:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363198398] [2025-03-03 23:13:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:15,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:15,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 23:13:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:13:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363198398] [2025-03-03 23:13:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363198398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:16,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:13:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841351728] [2025-03-03 23:13:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:16,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:13:16,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:13:16,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:13:16,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:13:16,117 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 23:13:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:16,162 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-03 23:13:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:13:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-03 23:13:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:16,165 INFO L225 Difference]: With dead ends: 102 [2025-03-03 23:13:16,165 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 23:13:16,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:13:16,166 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:16,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 23:13:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-03 23:13:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:13:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-03-03 23:13:16,185 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2025-03-03 23:13:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-03-03 23:13:16,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 23:13:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-03-03 23:13:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:16,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:16,188 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:16,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:13:16,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:16,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1286358676, now seen corresponding path program 1 times [2025-03-03 23:13:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:16,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519295439] [2025-03-03 23:13:16,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:16,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:16,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:16,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:16,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:16,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:13:16,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:16,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:16,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:16,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:16,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:13:16,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:13:16,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:13:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:13:16,365 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 23:13:16,410 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:13:16,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:13:16 BoogieIcfgContainer [2025-03-03 23:13:16,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:13:16,413 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:13:16,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:13:16,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:13:16,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:15" (3/4) ... [2025-03-03 23:13:16,417 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:13:16,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:13:16,418 INFO L158 Benchmark]: Toolchain (without parser) took 1833.71ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 58.9MB in the end (delta: 46.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:16,418 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:16,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.62ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.3MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:13:16,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:16,419 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:16,419 INFO L158 Benchmark]: IcfgBuilder took 269.63ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:13:16,419 INFO L158 Benchmark]: TraceAbstraction took 1252.59ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 58.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-03-03 23:13:16,419 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:16,420 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.62ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 92.3MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 269.63ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.3MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1252.59ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 58.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 142.6MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 70, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] signed short int var_1_8 = 4; [L27] float var_1_10 = 16.4; [L28] signed short int var_1_11 = -25; [L29] float var_1_13 = 128.1; [L30] float var_1_14 = 31.4; [L31] unsigned char var_1_15 = 2; [L32] unsigned char var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] float last_1_var_1_13 = 128.1; [L35] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L89] COND TRUE k_loop < 1 [L90] CALL updateLastVariables() [L78] last_1_var_1_13 = var_1_13 [L79] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L62] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L65] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L65] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L68] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L68] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L69] var_1_10 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L71] var_1_14 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L72] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L73] var_1_16 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L74] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=50, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=50, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=50, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L91] RET updateVariables() [L92] CALL step() [L39] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=50, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L44] var_1_17 = var_1_8 [L45] var_1_13 = var_1_14 [L46] var_1_15 = var_1_16 [L47] signed long int stepLocal_0 = (- 5) + var_1_17; VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, stepLocal_0=-1, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L48] COND FALSE !(stepLocal_0 >= var_1_15) [L51] var_1_1 = ((var_1_5 && var_1_6) || var_1_7) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L53] COND TRUE var_1_10 >= 500.875f [L54] var_1_11 = ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L92] RET step() [L93] CALL, EXPR property() [L82-L83] return ((((((((- 5) + var_1_17) >= var_1_15) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) ((var_1_5 && var_1_6) || var_1_7)))) && (var_1_5 ? ((0.4f > ((((last_1_var_1_13) < ((var_1_10 - 1.375f))) ? (last_1_var_1_13) : ((var_1_10 - 1.375f))))) ? (var_1_8 == ((signed short int) last_1_var_1_17)) : 1) : 1)) && ((var_1_10 >= 500.875f) ? (var_1_11 == ((signed short int) ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))))) : (var_1_11 == ((signed short int) var_1_15)))) && (var_1_13 == ((float) var_1_14))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((signed long int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=50, var_1_13=133, var_1_14=133, var_1_15=50, var_1_16=50, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 97 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 522/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:13:16,432 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-76.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 709453c15b134f79f9a4611d8c8b0ef9c4b2e09dcca78e096999d06822ec2635 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:18,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:18,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:13:18,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:18,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:18,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:18,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:18,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:18,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:18,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:18,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:18,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:18,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:18,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:18,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:18,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:18,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:18,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:18,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:18,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:18,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:18,292 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 -> 709453c15b134f79f9a4611d8c8b0ef9c4b2e09dcca78e096999d06822ec2635 [2025-03-03 23:13:18,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:18,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:18,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:18,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:18,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:18,540 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-76.i [2025-03-03 23:13:19,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b5da20/349c708ecbff4a3cafe91c044447cbbb/FLAG7e8053456 [2025-03-03 23:13:19,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:19,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-76.i [2025-03-03 23:13:19,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b5da20/349c708ecbff4a3cafe91c044447cbbb/FLAG7e8053456 [2025-03-03 23:13:20,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b5da20/349c708ecbff4a3cafe91c044447cbbb [2025-03-03 23:13:20,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:20,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:20,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:20,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:20,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:20,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133a17b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20, skipping insertion in model container [2025-03-03 23:13:20,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:20,302 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-76.i[915,928] [2025-03-03 23:13:20,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:20,341 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:20,349 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-76.i[915,928] [2025-03-03 23:13:20,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:20,372 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:20,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20 WrapperNode [2025-03-03 23:13:20,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:20,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:20,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:20,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:20,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,400 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-03 23:13:20,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:20,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:20,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:20,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:20,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,425 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-03 23:13:20,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:20,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:20,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:20,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:20,457 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (1/1) ... [2025-03-03 23:13:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:20,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:20,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:13:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:20,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:20,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:20,976 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:20,976 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:20,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:20,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:20,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:20 BoogieIcfgContainer [2025-03-03 23:13:20,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:20,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:20,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:20,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:20,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:20" (1/3) ... [2025-03-03 23:13:20,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21696a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:20, skipping insertion in model container [2025-03-03 23:13:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:20" (2/3) ... [2025-03-03 23:13:20,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21696a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:20, skipping insertion in model container [2025-03-03 23:13:20,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:20" (3/3) ... [2025-03-03 23:13:20,996 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-76.i [2025-03-03 23:13:21,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:21,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-76.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:21,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:21,063 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;@14734f2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:21,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:13:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:21,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:21,076 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:21,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 172922931, now seen corresponding path program 1 times [2025-03-03 23:13:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33514262] [2025-03-03 23:13:21,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:21,093 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-03 23:13:21,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:21,095 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-03 23:13:21,096 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-03 23:13:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:21,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:21,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:21,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:21,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:21,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 23:13:21,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:21,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:21,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33514262] [2025-03-03 23:13:21,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33514262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:21,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:21,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:13:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592035605] [2025-03-03 23:13:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:21,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:21,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:21,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:21,334 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 23:13:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:21,347 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2025-03-03 23:13:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-03-03 23:13:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:21,352 INFO L225 Difference]: With dead ends: 75 [2025-03-03 23:13:21,352 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 23:13:21,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-03 23:13:21,357 INFO L435 NwaCegarLoop]: 52 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, 52 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-03 23:13:21,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 23:13:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-03 23:13:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 23:13:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-03 23:13:21,384 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 69 [2025-03-03 23:13:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-03 23:13:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 23:13:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-03 23:13:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:21,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:21,386 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:21,393 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-03 23:13:21,587 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-03 23:13:21,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:21,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1257729525, now seen corresponding path program 1 times [2025-03-03 23:13:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401980046] [2025-03-03 23:13:21,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:21,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-03 23:13:21,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:21,591 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-03 23:13:21,591 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-03 23:13:21,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:21,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:21,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:21,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:21,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:13:21,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 23:13:21,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:21,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401980046] [2025-03-03 23:13:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401980046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:13:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367606594] [2025-03-03 23:13:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:13:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:13:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:13:21,947 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 23:13:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:22,087 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2025-03-03 23:13:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:13:22,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-03-03 23:13:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:22,093 INFO L225 Difference]: With dead ends: 102 [2025-03-03 23:13:22,093 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 23:13:22,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-03 23:13:22,094 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:22,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 130 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:13:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 23:13:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-03 23:13:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:13:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-03-03 23:13:22,108 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 69 [2025-03-03 23:13:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:22,108 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-03-03 23:13:22,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 23:13:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-03-03 23:13:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 23:13:22,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:22,112 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:22,121 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-03 23:13:22,312 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-03 23:13:22,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1286358676, now seen corresponding path program 1 times [2025-03-03 23:13:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:22,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376658342] [2025-03-03 23:13:22,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:22,314 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-03 23:13:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:22,317 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-03 23:13:22,317 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-03 23:13:22,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 23:13:22,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 23:13:22,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:22,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:22,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 23:13:22,462 INFO L279 TraceCheckSpWp]: Computing forward predicates...