./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.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_50-1loop_file-80.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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:36:42,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:36:42,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:36:42,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:36:42,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:36:42,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:36:42,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:36:42,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:36:42,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:36:42,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:36:42,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:36:42,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:36:42,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:36:42,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:36:42,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:36:42,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:36:42,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:36:42,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:36:42,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:36:42,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:36:42,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:36:42,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:36:42,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:36:42,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:36:42,791 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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2025-03-03 23:36:43,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:36:43,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:36:43,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:36:43,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:36:43,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:36:43,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:36:44,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2797516fd/172e1fd8477f4c6eadb962bb7273d44f/FLAG3c1b94ca5 [2025-03-03 23:36:44,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:36:44,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:36:44,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2797516fd/172e1fd8477f4c6eadb962bb7273d44f/FLAG3c1b94ca5 [2025-03-03 23:36:44,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2797516fd/172e1fd8477f4c6eadb962bb7273d44f [2025-03-03 23:36:44,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:36:44,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:36:44,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:36:44,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:36:44,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:36:44,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:44,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44, skipping insertion in model container [2025-03-03 23:36:44,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:44,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:36:44,815 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_50-1loop_file-80.i[915,928] [2025-03-03 23:36:44,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:36:44,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:36:44,897 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_50-1loop_file-80.i[915,928] [2025-03-03 23:36:44,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:36:44,933 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:36:44,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44 WrapperNode [2025-03-03 23:36:44,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:36:44,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:36:44,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:36:44,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:36:44,939 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:36:44" (1/1) ... [2025-03-03 23:36:44,950 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:36:44" (1/1) ... [2025-03-03 23:36:44,986 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-03 23:36:44,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:36:44,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:36:44,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:36:44,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:36:45,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,026 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:36:45,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:36:45,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:36:45,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:36:45,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:36:45,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (1/1) ... [2025-03-03 23:36:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:36:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:36:45,066 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:36:45,068 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:36:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:36:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:36:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:36:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:36:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:36:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:36:45,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:36:45,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:36:45,404 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:36:45,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:36:45,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:36:45,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:36:45,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:45 BoogieIcfgContainer [2025-03-03 23:36:45,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:36:45,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:36:45,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:36:45,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:36:45,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:36:44" (1/3) ... [2025-03-03 23:36:45,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469dfb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:45, skipping insertion in model container [2025-03-03 23:36:45,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:44" (2/3) ... [2025-03-03 23:36:45,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469dfb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:45, skipping insertion in model container [2025-03-03 23:36:45,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:45" (3/3) ... [2025-03-03 23:36:45,422 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:36:45,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:36:45,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:36:45,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:36:45,491 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;@32a587ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:36:45,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:36:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:36:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:36:45,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:45,504 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -75793549, now seen corresponding path program 1 times [2025-03-03 23:36:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:36:45,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172545935] [2025-03-03 23:36:45,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:36:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:36:45,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:36:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 23:36:45,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:36:45,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172545935] [2025-03-03 23:36:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172545935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:36:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108845174] [2025-03-03 23:36:45,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:45,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:36:45,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:36:45,749 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:36:45,750 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:36:45,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:36:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:36:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:45,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:36:45,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:36:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 23:36:45,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:36:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108845174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:36:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:36:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:36:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351719955] [2025-03-03 23:36:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:36:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:36:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:36:45,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:36:45,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:36:45,925 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 23:36:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:45,940 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2025-03-03 23:36:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:36:45,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-03-03 23:36:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:45,945 INFO L225 Difference]: With dead ends: 117 [2025-03-03 23:36:45,945 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 23:36:45,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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:36:45,949 INFO L435 NwaCegarLoop]: 87 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, 87 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:36:45,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:36:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 23:36:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 23:36:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:36:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-03-03 23:36:45,977 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-03-03 23:36:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:45,978 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-03-03 23:36:45,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 23:36:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-03-03 23:36:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:36:45,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:45,982 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,988 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:36:46,182 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:36:46,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 696073522, now seen corresponding path program 1 times [2025-03-03 23:36:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:36:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541499668] [2025-03-03 23:36:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:36:46,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:36:46,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:36:46,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:46,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:36:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:36:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541499668] [2025-03-03 23:36:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541499668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:36:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:36:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:36:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075566327] [2025-03-03 23:36:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:36:46,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:36:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:36:46,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:36:46,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:36:46,444 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:46,498 INFO L93 Difference]: Finished difference Result 165 states and 246 transitions. [2025-03-03 23:36:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:36:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-03 23:36:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:46,502 INFO L225 Difference]: With dead ends: 165 [2025-03-03 23:36:46,502 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:36:46,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:36:46,503 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:36:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:36:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:36:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2025-03-03 23:36:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:36:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-03 23:36:46,513 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2025-03-03 23:36:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:46,514 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-03 23:36:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-03 23:36:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:36:46,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:46,516 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:36:46,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 499560017, now seen corresponding path program 1 times [2025-03-03 23:36:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:36:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-03-03 23:36:46,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:36:46,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:36:46,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:36:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:46,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:36:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:36:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-03-03 23:36:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658987322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:36:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:36:46,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:36:46,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035003269] [2025-03-03 23:36:46,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:36:46,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:36:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:36:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:36:46,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:36:46,772 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:46,825 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2025-03-03 23:36:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:36:46,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-03 23:36:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:46,829 INFO L225 Difference]: With dead ends: 171 [2025-03-03 23:36:46,829 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 23:36:46,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:36:46,831 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:36:46,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:36:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 23:36:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-03 23:36:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 23:36:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-03-03 23:36:46,855 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 125 [2025-03-03 23:36:46,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:46,855 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-03-03 23:36:46,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-03-03 23:36:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:36:46,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:46,857 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:36:46,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:46,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash 825156241, now seen corresponding path program 1 times [2025-03-03 23:36:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:36:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072083267] [2025-03-03 23:36:46,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:36:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:36:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:36:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:36:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:36:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072083267] [2025-03-03 23:36:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072083267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:36:46,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:36:46,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:36:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892985980] [2025-03-03 23:36:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:36:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:36:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:36:46,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:36:46,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:36:46,953 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:46,975 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-03-03 23:36:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:36:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-03 23:36:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:46,976 INFO L225 Difference]: With dead ends: 167 [2025-03-03 23:36:46,976 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 23:36:46,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:36:46,977 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:36:46,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:36:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 23:36:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 23:36:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:36:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-03-03 23:36:46,988 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 125 [2025-03-03 23:36:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:46,989 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-03-03 23:36:46,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:36:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-03-03 23:36:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 23:36:46,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:46,990 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:36:46,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 832721616, now seen corresponding path program 1 times [2025-03-03 23:36:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:36:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513858578] [2025-03-03 23:36:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:36:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 23:36:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 23:36:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:36:47,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:36:47,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 23:36:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 23:36:47,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:47,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:36:47,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:36:47,173 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:36:47,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:36:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:36:47,177 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 23:36:47,250 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:36:47,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:36:47 BoogieIcfgContainer [2025-03-03 23:36:47,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:36:47,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:36:47,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:36:47,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:36:47,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:45" (3/4) ... [2025-03-03 23:36:47,256 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:36:47,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:36:47,258 INFO L158 Benchmark]: Toolchain (without parser) took 2550.31ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 65.5MB in the end (delta: 40.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-03 23:36:47,258 INFO L158 Benchmark]: CDTParser took 0.19ms. 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:36:47,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 91.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:36:47,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:36:47,258 INFO L158 Benchmark]: Boogie Preprocessor took 48.31ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 82.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:36:47,258 INFO L158 Benchmark]: IcfgBuilder took 376.49ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 61.2MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:36:47,259 INFO L158 Benchmark]: TraceAbstraction took 1838.30ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 65.5MB in the end (delta: -4.3MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2025-03-03 23:36:47,259 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:36:47,260 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.56ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 91.6MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.31ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 82.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 376.49ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 61.2MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1838.30ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 65.5MB in the end (delta: -4.3MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 65.5MB 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] isInitial = 1 [L127] FCALL initially() [L128] int k_loop; [L129] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] COND TRUE k_loop < 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L86] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L89] var_1_4 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L92] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L100] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L103] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L106] var_1_17 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L107] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L114] var_1_23 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L115] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L131] RET updateVariables() [L132] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L47] COND TRUE stepLocal_0 >= last_1_var_1_10 [L48] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L52] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L53] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L56] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L59] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L60] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L63] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L64] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L68] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L71] COND FALSE !(\read(var_1_19)) [L74] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] [L76] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] [L77] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L78] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] [L132] RET step() [L133] CALL, EXPR property() [L122-L123] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 631 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 335 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3384/3420 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:36:47,275 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_50-1loop_file-80.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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:36:49,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:36:49,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:36:49,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:36:49,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:36:49,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:36:49,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:36:49,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:36:49,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:36:49,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:36:49,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:36:49,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:36:49,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:36:49,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:36:49,122 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:36:49,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:36:49,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:36:49,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:36:49,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:36:49,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:36:49,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:36:49,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:36:49,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:36:49,124 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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2025-03-03 23:36:49,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:36:49,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:36:49,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:36:49,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:36:49,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:36:49,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:36:50,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045ed6df5/40af73e2a2df474280eced16fb718ee6/FLAGceea46b3e [2025-03-03 23:36:50,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:36:50,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:36:50,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045ed6df5/40af73e2a2df474280eced16fb718ee6/FLAGceea46b3e [2025-03-03 23:36:51,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045ed6df5/40af73e2a2df474280eced16fb718ee6 [2025-03-03 23:36:51,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:36:51,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:36:51,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:36:51,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:36:51,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:36:51,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293aa3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51, skipping insertion in model container [2025-03-03 23:36:51,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:36:51,194 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_50-1loop_file-80.i[915,928] [2025-03-03 23:36:51,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:36:51,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:36:51,253 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_50-1loop_file-80.i[915,928] [2025-03-03 23:36:51,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:36:51,288 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:36:51,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51 WrapperNode [2025-03-03 23:36:51,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:36:51,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:36:51,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:36:51,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:36:51,295 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:36:51" (1/1) ... [2025-03-03 23:36:51,310 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:36:51" (1/1) ... [2025-03-03 23:36:51,337 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-03 23:36:51,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:36:51,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:36:51,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:36:51,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:36:51,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,366 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:36:51,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:36:51,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:36:51,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:36:51,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:36:51,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (1/1) ... [2025-03-03 23:36:51,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:36:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:36:51,425 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:36:51,427 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:36:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:36:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:36:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:36:51,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:36:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:36:51,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:36:51,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:36:51,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:37:08,887 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:37:08,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:37:08,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:37:08,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:37:08,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:37:08 BoogieIcfgContainer [2025-03-03 23:37:08,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:37:08,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:37:08,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:37:08,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:37:08,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:36:51" (1/3) ... [2025-03-03 23:37:08,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7588f9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:37:08, skipping insertion in model container [2025-03-03 23:37:08,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:51" (2/3) ... [2025-03-03 23:37:08,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7588f9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:37:08, skipping insertion in model container [2025-03-03 23:37:08,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:37:08" (3/3) ... [2025-03-03 23:37:08,919 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-03-03 23:37:08,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:37:08,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:37:08,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:37:08,978 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;@3aec6921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:37:08,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:37:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:37:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:37:08,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:37:08,989 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:37:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:37:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -75793549, now seen corresponding path program 1 times [2025-03-03 23:37:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:37:09,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572498660] [2025-03-03 23:37:09,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:37:09,001 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:37:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:37:09,003 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:37:09,004 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:37:09,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:37:09,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:37:09,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:37:09,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:37:09,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:37:09,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:37:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-03 23:37:09,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:37:09,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:37:09,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572498660] [2025-03-03 23:37:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572498660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:37:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:37:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:37:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888072245] [2025-03-03 23:37:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:37:09,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:37:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:37:09,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:37:09,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:37:09,988 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 23:37:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:37:10,002 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2025-03-03 23:37:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:37:10,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-03-03 23:37:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:37:10,007 INFO L225 Difference]: With dead ends: 117 [2025-03-03 23:37:10,007 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 23:37:10,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:37:10,011 INFO L435 NwaCegarLoop]: 87 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, 87 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:37:10,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:37:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 23:37:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 23:37:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:37:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-03-03 23:37:10,039 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-03-03 23:37:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:37:10,039 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-03-03 23:37:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 23:37:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-03-03 23:37:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:37:10,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:37:10,041 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:10,065 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 23:37:10,241 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:37:10,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:37:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:37:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 696073522, now seen corresponding path program 1 times [2025-03-03 23:37:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:37:10,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688596425] [2025-03-03 23:37:10,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:37:10,244 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:37:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:37:10,247 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:37:10,248 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:37:10,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:37:11,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:37:11,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:37:11,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:37:11,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:37:11,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:37:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:37:11,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:37:11,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:37:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688596425] [2025-03-03 23:37:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688596425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:37:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:37:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:37:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701660431] [2025-03-03 23:37:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:37:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:37:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:37:11,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:37:11,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:37:11,386 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:37:16,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 23:37:20,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 23:37:24,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 23:37:28,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 23:37:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:37:28,084 INFO L93 Difference]: Finished difference Result 165 states and 246 transitions. [2025-03-03 23:37:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:37:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-03 23:37:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:37:28,203 INFO L225 Difference]: With dead ends: 165 [2025-03-03 23:37:28,203 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:37:28,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:37:28,204 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:37:28,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 232 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2025-03-03 23:37:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:37:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2025-03-03 23:37:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 23:37:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-03 23:37:28,218 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2025-03-03 23:37:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:37:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-03 23:37:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:37:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-03 23:37:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:37:28,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:37:28,221 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:28,248 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 23:37:28,421 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:37:28,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:37:28,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:37:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash 499560017, now seen corresponding path program 1 times [2025-03-03 23:37:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:37:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912592088] [2025-03-03 23:37:28,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:37:28,426 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:37:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:37:28,428 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:37:28,429 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:37:28,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:37:29,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:37:29,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:37:29,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:37:29,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:37:29,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:37:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:37:32,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:37:32,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:37:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912592088] [2025-03-03 23:37:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912592088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:37:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:37:32,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:37:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451719688] [2025-03-03 23:37:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:37:32,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:37:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:37:32,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:37:32,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:37:32,353 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:37:36,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:37:40,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:37:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:37:40,819 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2025-03-03 23:37:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:37:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-03-03 23:37:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:37:40,921 INFO L225 Difference]: With dead ends: 169 [2025-03-03 23:37:40,921 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 23:37:40,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:37:40,922 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:37:40,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-03 23:37:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 23:37:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2025-03-03 23:37:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 23:37:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-03-03 23:37:40,938 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 125 [2025-03-03 23:37:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:37:40,939 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-03-03 23:37:40,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:37:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-03-03 23:37:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 23:37:40,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:37:40,942 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:40,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 23:37:41,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:37:41,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:37:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:37:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 825156241, now seen corresponding path program 1 times [2025-03-03 23:37:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:37:41,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861960233] [2025-03-03 23:37:41,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:37:41,144 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:37:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:37:41,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:37:41,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 23:37:41,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 23:37:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 23:37:41,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:37:41,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:37:42,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:37:42,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:37:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 23:37:45,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:37:45,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:37:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861960233] [2025-03-03 23:37:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861960233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:37:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:37:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:37:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727242019] [2025-03-03 23:37:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:37:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:37:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:37:45,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:37:45,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:37:45,124 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 23:37:50,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:37:53,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:37:58,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:02,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:03,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:07,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:11,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:15,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:19,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:23,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:38:27,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []