./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.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 ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:28:04,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:28:04,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:28:04,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:28:04,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:28:04,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:28:04,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:28:04,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:28:04,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:28:04,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:28:04,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:28:04,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:28:04,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:28:04,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:28:04,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:28:04,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:04,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:28:04,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:28:04,570 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 -> ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 [2025-03-08 14:28:04,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:28:04,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:28:04,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:28:04,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:28:04,772 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:28:04,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:05,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441d13eba/ce0b336d6a7b4c52b9e9c513df0d65e9/FLAGf17f721d9 [2025-03-08 14:28:06,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:28:06,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:06,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441d13eba/ce0b336d6a7b4c52b9e9c513df0d65e9/FLAGf17f721d9 [2025-03-08 14:28:06,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441d13eba/ce0b336d6a7b4c52b9e9c513df0d65e9 [2025-03-08 14:28:06,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:28:06,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:28:06,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:06,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:28:06,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:28:06,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27051e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06, skipping insertion in model container [2025-03-08 14:28:06,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:28:06,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2025-03-08 14:28:06,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:06,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:28:06,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2025-03-08 14:28:06,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:06,647 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:28:06,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06 WrapperNode [2025-03-08 14:28:06,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:06,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:06,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:28:06,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:28:06,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,682 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-08 14:28:06,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:06,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:28:06,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:28:06,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:28:06,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,710 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-08 14:28:06,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:28:06,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:28:06,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:28:06,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:28:06,726 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (1/1) ... [2025-03-08 14:28:06,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:06,757 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-08 14:28:06,759 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-08 14:28:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:28:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:28:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:28:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:28:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:28:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:28:06,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:28:06,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:28:06,978 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~ite11#1;havoc property_#t~bitwise10#1;havoc property_#t~short12#1; [2025-03-08 14:28:06,996 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:28:06,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:28:07,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:28:07,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:28:07,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:07 BoogieIcfgContainer [2025-03-08 14:28:07,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:28:07,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:28:07,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:28:07,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:28:07,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:28:06" (1/3) ... [2025-03-08 14:28:07,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087daa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:07, skipping insertion in model container [2025-03-08 14:28:07,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:06" (2/3) ... [2025-03-08 14:28:07,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2087daa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:07, skipping insertion in model container [2025-03-08 14:28:07,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:07" (3/3) ... [2025-03-08 14:28:07,015 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:07,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:28:07,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-1.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:28:07,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:28:07,078 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;@7239d975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:28:07,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:28:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:28:07,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:07,088 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:28:07,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash -268721577, now seen corresponding path program 1 times [2025-03-08 14:28:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:28:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545098830] [2025-03-08 14:28:07,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:28:07,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:28:07,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:28:07,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:07,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:28:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:28:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545098830] [2025-03-08 14:28:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545098830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:28:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678296353] [2025-03-08 14:28:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:28:07,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:07,238 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-08 14:28:07,243 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-08 14:28:07,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:28:07,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:28:07,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:07,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:07,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:28:07,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 14:28:07,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:07,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678296353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:07,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:28:07,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:28:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919617263] [2025-03-08 14:28:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:28:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:28:07,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:28:07,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:07,370 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:07,389 INFO L93 Difference]: Finished difference Result 100 states and 158 transitions. [2025-03-08 14:28:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:28:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-03-08 14:28:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:07,395 INFO L225 Difference]: With dead ends: 100 [2025-03-08 14:28:07,395 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 14:28:07,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-08 14:28:07,400 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:28:07,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 14:28:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 14:28:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-08 14:28:07,431 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 66 [2025-03-08 14:28:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:07,432 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-08 14:28:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-08 14:28:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 14:28:07,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:07,434 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:28:07,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:28:07,634 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-08 14:28:07,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 990062360, now seen corresponding path program 1 times [2025-03-08 14:28:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:28:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549741802] [2025-03-08 14:28:07,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:28:07,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:28:07,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:28:07,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:07,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:28:07,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:28:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 14:28:07,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 14:28:07,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:07,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:28:07,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:28:07,751 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:28:07,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:28:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:28:07,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:28:07,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:28:07,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:28:07 BoogieIcfgContainer [2025-03-08 14:28:07,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:28:07,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:28:07,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:28:07,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:28:07,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:07" (3/4) ... [2025-03-08 14:28:07,797 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:28:07,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:28:07,798 INFO L158 Benchmark]: Toolchain (without parser) took 1338.71ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 45.5MB in the end (delta: 76.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-08 14:28:07,798 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:07,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.24ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:28:07,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.03ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:28:07,799 INFO L158 Benchmark]: Boogie Preprocessor took 41.71ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:07,799 INFO L158 Benchmark]: IcfgBuilder took 282.78ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 89.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:28:07,799 INFO L158 Benchmark]: TraceAbstraction took 784.22ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 45.5MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 14:28:07,799 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:28:07,800 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.24ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.03ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.71ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.78ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 89.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 784.22ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 45.5MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 167.8MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someUnaryFLOAToperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_4 = 256.2; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_9 = 25; [L26] signed char var_1_10 = 4; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] signed char var_1_13 = -1; [L30] signed long int var_1_14 = 256; [L31] float var_1_15 = 127.2; [L32] signed char last_1_var_1_10 = 4; [L33] signed long int last_1_var_1_14 = 256; [L34] float last_1_var_1_15 = 127.2; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_4=1281/5, var_1_5=128, var_1_9=25] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L81] last_1_var_1_10 = var_1_10 [L82] last_1_var_1_14 = var_1_14 [L83] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_4=1281/5, var_1_5=128, var_1_9=25] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L67] var_1_9 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L69] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L69] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L70] var_1_11 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L71] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L72] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L73] var_1_12 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L74] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L75] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L77] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L78] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=0] [L94] RET updateVariables() [L95] CALL step() [L38] COND FALSE !(last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) [L45] var_1_5 = var_1_9 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=0, var_1_9=0] [L47] var_1_14 = var_1_5 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=636/5, var_1_1=11/2, var_1_5=0, var_1_9=0] [L48] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=636/5, var_1_1=11/2, var_1_5=0, var_1_9=0] [L53] var_1_15 = var_1_4 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=261, var_1_1=11/2, var_1_4=261, var_1_5=0, var_1_9=0] [L54] COND TRUE var_1_15 <= (- var_1_15) [L55] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=0, var_1_9=0] [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR ((var_1_15 <= (- var_1_15)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : ((var_1_15 > var_1_15) ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) ? ((((4 + last_1_var_1_10) ^ last_1_var_1_14) >= last_1_var_1_10) ? (var_1_5 == ((unsigned char) 0)) : (var_1_5 == ((unsigned char) var_1_9))) : (var_1_5 == ((unsigned char) var_1_9))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=0, var_1_9=0] [L86-L87] return (((((var_1_15 <= (- var_1_15)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : ((var_1_15 > var_1_15) ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) ? ((((4 + last_1_var_1_10) ^ last_1_var_1_14) >= last_1_var_1_10) ? (var_1_5 == ((unsigned char) 0)) : (var_1_5 == ((unsigned char) var_1_9))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_11 ? ((! var_1_12) ? (var_1_10 == ((signed char) var_1_13)) : 1) : 1)) && (var_1_14 == ((signed long int) var_1_5))) && (var_1_15 == ((float) var_1_4)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-127, var_1_14=0, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 86 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 70 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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-08 14:28:07,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.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 ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:28:09,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:28:09,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:28:09,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:28:09,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:28:09,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:28:09,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:28:09,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:28:09,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:28:09,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:28:09,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:28:09,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:28:09,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:28:09,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:28:09,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:28:09,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:28:09,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:28:09,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:09,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:28:09,642 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:28:09,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:28:09,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:28:09,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:28:09,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:28:09,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:28:09,643 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 -> ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 [2025-03-08 14:28:09,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:28:09,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:28:09,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:28:09,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:28:09,859 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:28:09,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:10,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3a4a5f8/b7ea1f3081ae459f8315a64a5f69cb3e/FLAG06d9da3c7 [2025-03-08 14:28:11,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:28:11,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:11,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3a4a5f8/b7ea1f3081ae459f8315a64a5f69cb3e/FLAG06d9da3c7 [2025-03-08 14:28:11,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3a4a5f8/b7ea1f3081ae459f8315a64a5f69cb3e [2025-03-08 14:28:11,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:28:11,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:28:11,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:11,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:28:11,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:28:11,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11, skipping insertion in model container [2025-03-08 14:28:11,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:28:11,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2025-03-08 14:28:11,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:11,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:28:11,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2025-03-08 14:28:11,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:28:11,416 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:28:11,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11 WrapperNode [2025-03-08 14:28:11,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:28:11,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:11,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:28:11,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:28:11,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,446 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-08 14:28:11,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:28:11,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:28:11,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:28:11,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:28:11,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,467 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-08 14:28:11,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:28:11,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:28:11,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:28:11,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:28:11,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (1/1) ... [2025-03-08 14:28:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:28:11,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:28:11,500 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-08 14:28:11,504 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-08 14:28:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:28:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:28:11,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:28:11,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:28:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:28:11,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:28:11,567 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:28:11,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:28:11,720 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 14:28:11,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:28:11,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:28:11,728 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:28:11,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:11 BoogieIcfgContainer [2025-03-08 14:28:11,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:28:11,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:28:11,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:28:11,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:28:11,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:28:11" (1/3) ... [2025-03-08 14:28:11,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da6261f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:11, skipping insertion in model container [2025-03-08 14:28:11,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:28:11" (2/3) ... [2025-03-08 14:28:11,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da6261f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:28:11, skipping insertion in model container [2025-03-08 14:28:11,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:28:11" (3/3) ... [2025-03-08 14:28:11,737 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-1.i [2025-03-08 14:28:11,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:28:11,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-1.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:28:11,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:28:11,796 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;@52bcbc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:28:11,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:28:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 14:28:11,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:11,806 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:28:11,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:11,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 795853081, now seen corresponding path program 1 times [2025-03-08 14:28:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887533642] [2025-03-08 14:28:11,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:11,818 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-08 14:28:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:11,820 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-08 14:28:11,822 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-08 14:28:11,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 14:28:11,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 14:28:11,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:11,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:11,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:28:11,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:28:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 14:28:11,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:28:11,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:28:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887533642] [2025-03-08 14:28:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887533642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:28:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:28:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:28:11,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395373512] [2025-03-08 14:28:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:28:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:28:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:28:12,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:28:12,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:28:12,010 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:28:12,022 INFO L93 Difference]: Finished difference Result 74 states and 116 transitions. [2025-03-08 14:28:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:28:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-08 14:28:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:28:12,027 INFO L225 Difference]: With dead ends: 74 [2025-03-08 14:28:12,027 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 14:28:12,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-08 14:28:12,031 INFO L435 NwaCegarLoop]: 50 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, 50 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-08 14:28:12,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:28:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 14:28:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 14:28:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 14:28:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-08 14:28:12,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2025-03-08 14:28:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:28:12,053 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-08 14:28:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 14:28:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-03-08 14:28:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 14:28:12,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:28:12,055 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:28:12,063 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-08 14:28:12,255 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-08 14:28:12,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:28:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:28:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -396131814, now seen corresponding path program 1 times [2025-03-08 14:28:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:28:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34393122] [2025-03-08 14:28:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:28:12,257 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-08 14:28:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:28:12,260 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-08 14:28:12,261 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-08 14:28:12,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 14:28:12,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 14:28:12,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:28:12,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:28:12,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 14:28:12,412 INFO L279 TraceCheckSpWp]: Computing forward predicates...