./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.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-1loop_file-75.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 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:24:50,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:24:50,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:24:50,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:24:50,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:24:50,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:24:50,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:24:50,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:24:50,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:24:50,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:24:50,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:24:50,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:24:50,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:24:50,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:24:50,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:24:50,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:24:50,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:24:50,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:24:50,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:24:50,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:50,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:24:50,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:24:50,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:24:50,575 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 -> 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 [2025-03-08 14:24:50,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:24:50,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:24:50,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:24:50,809 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:24:50,809 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:24:50,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:24:51,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cfdd0dd/8b32b7341f514799b81cba9075d04981/FLAG93f8f464b [2025-03-08 14:24:52,241 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:24:52,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:24:52,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cfdd0dd/8b32b7341f514799b81cba9075d04981/FLAG93f8f464b [2025-03-08 14:24:52,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cfdd0dd/8b32b7341f514799b81cba9075d04981 [2025-03-08 14:24:52,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:24:52,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:24:52,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:52,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:24:52,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:24:52,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a285505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52, skipping insertion in model container [2025-03-08 14:24:52,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:24:52,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2025-03-08 14:24:52,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:52,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:24:52,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2025-03-08 14:24:52,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:52,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:24:52,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52 WrapperNode [2025-03-08 14:24:52,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:52,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:52,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:24:52,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:24:52,746 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:24:52" (1/1) ... [2025-03-08 14:24:52,753 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:24:52" (1/1) ... [2025-03-08 14:24:52,776 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-08 14:24:52,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:52,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:24:52,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:24:52,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:24:52,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,802 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:24:52,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:24:52,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:24:52,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:24:52,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:24:52,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (1/1) ... [2025-03-08 14:24:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:52,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:52,844 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:24:52,850 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:24:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:24:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:24:52,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:24:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:24:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:24:52,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:24:52,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:24:52,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:24:53,136 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:24:53,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:24:53,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:24:53,145 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:24:53,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:53 BoogieIcfgContainer [2025-03-08 14:24:53,146 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:24:53,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:24:53,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:24:53,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:24:53,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:24:52" (1/3) ... [2025-03-08 14:24:53,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94f6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:53, skipping insertion in model container [2025-03-08 14:24:53,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:52" (2/3) ... [2025-03-08 14:24:53,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b94f6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:24:53, skipping insertion in model container [2025-03-08 14:24:53,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:53" (3/3) ... [2025-03-08 14:24:53,153 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:24:53,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:24:53,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:24:53,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:24:53,209 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;@3d760a08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:24:53,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:24:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:24:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:24:53,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:53,220 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1353505916, now seen corresponding path program 1 times [2025-03-08 14:24:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19050284] [2025-03-08 14:24:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:53,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:53,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 14:24:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19050284] [2025-03-08 14:24:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19050284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:24:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33006675] [2025-03-08 14:24:53,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:24:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:53,432 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:24:53,433 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:24:53,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:53,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:53,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:53,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:53,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:24:53,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:24:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 14:24:53,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:24:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33006675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:24:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:24:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467308668] [2025-03-08 14:24:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:53,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:24:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:24:53,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:24:53,570 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:24:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:53,583 INFO L93 Difference]: Finished difference Result 87 states and 137 transitions. [2025-03-08 14:24:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:24:53,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 14:24:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:53,588 INFO L225 Difference]: With dead ends: 87 [2025-03-08 14:24:53,589 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 14:24:53,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:24:53,592 INFO L435 NwaCegarLoop]: 61 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, 61 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:24:53,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:24:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 14:24:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 14:24:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:24:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 14:24:53,620 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-03-08 14:24:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:53,620 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 14:24:53,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:24:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 14:24:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:24:53,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:53,623 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,629 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:24:53,824 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:24:53,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:53,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1050018016, now seen corresponding path program 1 times [2025-03-08 14:24:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:53,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344350705] [2025-03-08 14:24:53,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:53,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:53,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:53,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:24:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924984747] [2025-03-08 14:24:53,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:24:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:53,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:24:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:24:54,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:54,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:54,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:54,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:24:54,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:24:54,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:24:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 14:24:54,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:24:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:24:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344350705] [2025-03-08 14:24:54,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:24:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924984747] [2025-03-08 14:24:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924984747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:24:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:24:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:24:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012859512] [2025-03-08 14:24:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:24:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:24:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:24:54,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:24:54,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:24:54,237 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 14:24:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:24:54,348 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-08 14:24:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:24:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 14:24:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:24:54,350 INFO L225 Difference]: With dead ends: 121 [2025-03-08 14:24:54,350 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 14:24:54,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:24:54,351 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:24:54,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:24:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 14:24:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 14:24:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:24:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-03-08 14:24:54,366 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-03-08 14:24:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:24:54,366 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-03-08 14:24:54,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 14:24:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-03-08 14:24:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:24:54,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:24:54,369 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:54,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:24:54,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 14:24:54,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:24:54,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:24:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1502138945, now seen corresponding path program 1 times [2025-03-08 14:24:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:24:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740253420] [2025-03-08 14:24:54,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:24:54,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:54,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:54,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:24:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244510197] [2025-03-08 14:24:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:24:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:24:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:54,663 INFO L229 MonitoredProcess]: Starting monitored process 4 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:24:54,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:24:54,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:54,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:54,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:24:54,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:24:54,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:24:54,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:24:54,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:24:54,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:24:54,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:24:54,826 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:24:54,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:24:54,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:24:55,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:24:55,031 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:24:55,079 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:24:55,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:24:55 BoogieIcfgContainer [2025-03-08 14:24:55,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:24:55,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:24:55,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:24:55,083 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:24:55,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:24:53" (3/4) ... [2025-03-08 14:24:55,085 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:24:55,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:24:55,087 INFO L158 Benchmark]: Toolchain (without parser) took 2532.46ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 71.9MB in the end (delta: 61.9MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-03-08 14:24:55,087 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:24:55,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.35ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 120.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:24:55,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.69ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:24:55,090 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 112.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:24:55,091 INFO L158 Benchmark]: IcfgBuilder took 331.85ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 93.7MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:24:55,091 INFO L158 Benchmark]: TraceAbstraction took 1935.28ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 72.0MB in the end (delta: 20.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-03-08 14:24:55,091 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:24:55,092 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.83ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.35ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 120.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.69ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 112.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 331.85ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 93.7MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1935.28ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 72.0MB in the end (delta: 20.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 50.8kB). 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 77, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_7 = 128; [L24] unsigned char var_1_8 = 64; [L25] unsigned char var_1_9 = 100; [L26] unsigned char var_1_10 = 1; [L27] float var_1_11 = -0.6; [L28] unsigned char var_1_12 = 1; [L29] double var_1_13 = 999999999999999.2; [L30] float var_1_14 = 50.25; [L31] float var_1_15 = 15.5; [L32] float var_1_16 = 128.5; [L33] unsigned char var_1_17 = 0; [L34] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L92] COND TRUE k_loop < 1 [L93] CALL updateLastVariables() [L82] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L57] var_1_7 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L58] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L59] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L59] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=64, var_1_9=100] [L60] var_1_8 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L61] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L62] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L62] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=100] [L63] var_1_9 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L64] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L65] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L65] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L68] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L68] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L69] var_1_12 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L70] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L71] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L71] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L72] var_1_13 = __VERIFIER_nondet_double() [L73] 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_17=0, var_1_10=-193, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L73] 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_17=0, var_1_10=-193, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L74] var_1_14 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L75] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L76] var_1_15 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L77] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L78] var_1_16 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L94] RET updateVariables() [L95] CALL step() [L38] signed long int stepLocal_0 = (last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_0=0, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=-129, var_1_8=63, var_1_9=63] [L39] COND FALSE !(stepLocal_0 < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) [L42] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L44] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_1=63, var_1_10=-193, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L45] COND TRUE stepLocal_1 >= var_1_1 [L46] var_1_17 = (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_12=0, var_1_17=64, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L50] COND TRUE var_1_12 || ((var_1_13 * 49.25) == 32.8) [L51] var_1_11 = (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return (((((last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17) < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_1 == ((unsigned char) (var_1_7 - (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)))) : (var_1_1 == ((unsigned char) var_1_8))) && ((var_1_12 || ((var_1_13 * 49.25) == 32.8)) ? (var_1_11 == ((float) (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))))) : (var_1_11 == ((float) var_1_15)))) && ((var_1_1 >= var_1_1) ? (var_1_17 == ((unsigned char) (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))))) : (var_1_17 == ((unsigned char) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-193, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=64, var_1_1=63, var_1_7=-129, var_1_8=63, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 77 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 115 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 445 SizeOfPredicates, 1 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 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:24:55,104 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-1loop_file-75.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 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:24:56,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:24:56,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:24:56,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:24:56,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:24:57,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:24:57,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:24:57,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:24:57,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:24:57,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:24:57,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:24:57,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:24:57,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:57,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:24:57,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:24:57,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:24:57,010 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 -> 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 [2025-03-08 14:24:57,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:24:57,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:24:57,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:24:57,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:24:57,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:24:57,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:24:58,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c262fda/cfc32fe237e74afd8966aeda43f294d2/FLAG78b10119b [2025-03-08 14:24:58,538 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:24:58,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:24:58,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c262fda/cfc32fe237e74afd8966aeda43f294d2/FLAG78b10119b [2025-03-08 14:24:58,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5c262fda/cfc32fe237e74afd8966aeda43f294d2 [2025-03-08 14:24:58,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:24:58,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:24:58,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:58,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:24:58,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:24:58,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:58" (1/1) ... [2025-03-08 14:24:58,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab425a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:58, skipping insertion in model container [2025-03-08 14:24:58,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:58" (1/1) ... [2025-03-08 14:24:58,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:24:59,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2025-03-08 14:24:59,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:59,072 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:24:59,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2025-03-08 14:24:59,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:24:59,107 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:24:59,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59 WrapperNode [2025-03-08 14:24:59,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:24:59,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:59,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:24:59,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:24:59,114 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:24:59" (1/1) ... [2025-03-08 14:24:59,126 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:24:59" (1/1) ... [2025-03-08 14:24:59,149 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2025-03-08 14:24:59,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:24:59,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:24:59,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:24:59,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:24:59,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,178 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:24:59,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:24:59,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:24:59,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:24:59,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:24:59,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (1/1) ... [2025-03-08 14:24:59,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:24:59,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:24:59,224 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:24:59,227 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:24:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:24:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:24:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:24:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:24:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:24:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:24:59,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:24:59,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:25:00,226 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:25:00,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:25:00,232 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:25:00,234 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:25:00,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:00 BoogieIcfgContainer [2025-03-08 14:25:00,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:25:00,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:25:00,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:25:00,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:25:00,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:24:58" (1/3) ... [2025-03-08 14:25:00,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513c446b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:00, skipping insertion in model container [2025-03-08 14:25:00,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:59" (2/3) ... [2025-03-08 14:25:00,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513c446b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:00, skipping insertion in model container [2025-03-08 14:25:00,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:00" (3/3) ... [2025-03-08 14:25:00,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i [2025-03-08 14:25:00,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:25:00,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:25:00,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:25:00,305 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;@25901044, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:25:00,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:25:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:25:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:25:00,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:25:00,330 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:00,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:25:00,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:25:00,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1353505916, now seen corresponding path program 1 times [2025-03-08 14:25:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:25:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718513660] [2025-03-08 14:25:00,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:00,346 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:25:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:25:00,348 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:25:00,349 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:25:00,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:25:00,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:25:00,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:25:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:25:00,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:25:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 14:25:00,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:25:00,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:25:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718513660] [2025-03-08 14:25:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718513660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:25:00,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:25:00,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:25:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571754700] [2025-03-08 14:25:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:25:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:25:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:25:00,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:25:00,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:25:00,626 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:25:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:25:00,642 INFO L93 Difference]: Finished difference Result 87 states and 137 transitions. [2025-03-08 14:25:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:25:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-08 14:25:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:25:00,647 INFO L225 Difference]: With dead ends: 87 [2025-03-08 14:25:00,647 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 14:25:00,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:25:00,651 INFO L435 NwaCegarLoop]: 61 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, 61 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:25:00,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:25:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 14:25:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 14:25:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 14:25:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-08 14:25:00,673 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 92 [2025-03-08 14:25:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:25:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-08 14:25:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 14:25:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-08 14:25:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:25:00,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:25:00,676 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:00,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:25:00,876 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:25:00,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:25:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:25:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1050018016, now seen corresponding path program 1 times [2025-03-08 14:25:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:25:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085018019] [2025-03-08 14:25:00,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:00,878 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:25:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:25:00,880 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:25:00,881 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:25:00,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:25:01,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:25:01,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:01,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:25:01,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:25:01,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:25:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 14:25:01,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:25:01,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:25:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085018019] [2025-03-08 14:25:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085018019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:25:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:25:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:25:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265688168] [2025-03-08 14:25:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:25:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:25:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:25:01,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:25:01,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:25:01,338 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 14:25:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:25:02,447 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-08 14:25:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:25:02,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-08 14:25:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:25:02,457 INFO L225 Difference]: With dead ends: 121 [2025-03-08 14:25:02,457 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 14:25:02,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:25:02,458 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:25:02,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 14:25:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 14:25:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2025-03-08 14:25:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:25:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2025-03-08 14:25:02,472 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 92 [2025-03-08 14:25:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:25:02,473 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2025-03-08 14:25:02,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 14:25:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2025-03-08 14:25:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 14:25:02,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:25:02,474 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:02,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:25:02,675 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-08 14:25:02,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:25:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:25:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1502138945, now seen corresponding path program 1 times [2025-03-08 14:25:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:25:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003490946] [2025-03-08 14:25:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:25:02,676 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:25:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:25:02,678 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-08 14:25:02,679 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-08 14:25:02,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 14:25:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 14:25:02,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:25:02,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:25:02,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 14:25:02,872 INFO L279 TraceCheckSpWp]: Computing forward predicates...