./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:56,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:56,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:56,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:56,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:56,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:56,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:56,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:56,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:56,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:56,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:56,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:56,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:56,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:56,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:56,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:56,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:56,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:56,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:56,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:56,104 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 -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2025-03-03 23:15:56,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:56,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:56,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:56,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:56,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:56,326 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-97.i [2025-03-03 23:15:57,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f4d1c4/b2f88b877bea4e638144902f75e03b30/FLAG5703c59bf [2025-03-03 23:15:57,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:57,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-03-03 23:15:57,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f4d1c4/b2f88b877bea4e638144902f75e03b30/FLAG5703c59bf [2025-03-03 23:15:57,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f4d1c4/b2f88b877bea4e638144902f75e03b30 [2025-03-03 23:15:57,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:57,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:57,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:57,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:57,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:57,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:57,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57, skipping insertion in model container [2025-03-03 23:15:57,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:57,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:57,901 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-97.i[915,928] [2025-03-03 23:15:57,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:57,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:57,956 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-97.i[915,928] [2025-03-03 23:15:57,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:57,989 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:57,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57 WrapperNode [2025-03-03 23:15:57,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:57,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:57,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:57,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:57,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,025 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-03 23:15:58,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:58,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:58,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:58,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:58,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,052 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:15:58,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:58,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:58,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:58,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:58,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (1/1) ... [2025-03-03 23:15:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:58,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:15:58,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:15:58,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:58,150 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:58,152 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:58,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-03 23:15:58,309 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:58,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:58,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:58,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:58,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:58 BoogieIcfgContainer [2025-03-03 23:15:58,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:58,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:58,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:58,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:58,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:57" (1/3) ... [2025-03-03 23:15:58,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0115b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:58, skipping insertion in model container [2025-03-03 23:15:58,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:57" (2/3) ... [2025-03-03 23:15:58,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0115b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:58, skipping insertion in model container [2025-03-03 23:15:58,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:58" (3/3) ... [2025-03-03 23:15:58,335 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-03-03 23:15:58,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:58,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:58,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:58,392 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;@6f5f3423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:58,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:15:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:15:58,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:58,404 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:15:58,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1713011915, now seen corresponding path program 1 times [2025-03-03 23:15:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-03-03 23:15:58,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:58,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:15:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:15:58,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:58,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:15:58,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-03-03 23:15:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587284337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356672035] [2025-03-03 23:15:58,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:58,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:58,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:15:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:15:58,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:15:58,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:15:58,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:58,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:58,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:58,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:15:58,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356672035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:58,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:58,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453670183] [2025-03-03 23:15:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:58,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:58,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:58,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:58,754 INFO L87 Difference]: Start difference. First operand has 60 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:15:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:58,778 INFO L93 Difference]: Finished difference Result 116 states and 189 transitions. [2025-03-03 23:15:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-03 23:15:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:58,785 INFO L225 Difference]: With dead ends: 116 [2025-03-03 23:15:58,785 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 23:15:58,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:58,790 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:58,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 23:15:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 23:15:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:15:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-03-03 23:15:58,823 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 103 [2025-03-03 23:15:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:58,823 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-03-03 23:15:58,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:15:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-03-03 23:15:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 23:15:58,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:58,826 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:15:58,832 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-03 23:15:59,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:15:59,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1206734871, now seen corresponding path program 1 times [2025-03-03 23:15:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-03-03 23:15:59,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:59,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 23:15:59,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 23:15:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:15:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-03-03 23:15:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846718225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:15:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517523323] [2025-03-03 23:15:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:59,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:15:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:59,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:15:59,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:15:59,428 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:15:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:59,498 INFO L93 Difference]: Finished difference Result 131 states and 190 transitions. [2025-03-03 23:15:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 23:15:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:59,499 INFO L225 Difference]: With dead ends: 131 [2025-03-03 23:15:59,499 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 23:15:59,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:15:59,500 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 27 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:59,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 314 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 23:15:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-03-03 23:15:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:15:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-03-03 23:15:59,510 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 103 [2025-03-03 23:15:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:59,512 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-03-03 23:15:59,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:15:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-03-03 23:15:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 23:15:59,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:59,514 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:15:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:59,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1146068444, now seen corresponding path program 1 times [2025-03-03 23:15:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-03 23:15:59,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:59,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 23:15:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 23:15:59,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:59,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:15:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-03 23:15:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724961754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:15:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675682842] [2025-03-03 23:15:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:59,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:15:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:59,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:15:59,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:15:59,700 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:15:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:59,863 INFO L93 Difference]: Finished difference Result 172 states and 251 transitions. [2025-03-03 23:15:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:15:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-03 23:15:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:59,865 INFO L225 Difference]: With dead ends: 172 [2025-03-03 23:15:59,867 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 23:15:59,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:15:59,868 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 100 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:59,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 355 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:15:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 23:15:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2025-03-03 23:15:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:15:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-03 23:15:59,881 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 104 [2025-03-03 23:15:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:59,881 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-03 23:15:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:15:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-03-03 23:15:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 23:15:59,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:59,884 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:15:59,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:15:59,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:59,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -795358123, now seen corresponding path program 1 times [2025-03-03 23:15:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:59,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982606795] [2025-03-03 23:15:59,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 23:15:59,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 23:15:59,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:59,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:59,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:59,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 23:15:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 23:15:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:16:00,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:16:00,015 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:16:00,015 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:16:00,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:16:00,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:16:00,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:16:00,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:16:00 BoogieIcfgContainer [2025-03-03 23:16:00,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:16:00,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:16:00,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:16:00,086 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:16:00,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:58" (3/4) ... [2025-03-03 23:16:00,091 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:16:00,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:16:00,092 INFO L158 Benchmark]: Toolchain (without parser) took 2309.80ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 54.5MB in the end (delta: 52.8MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.82ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 94.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: IcfgBuilder took 262.41ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 73.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: TraceAbstraction took 1756.18ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 55.4MB in the end (delta: 17.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2025-03-03 23:16:00,093 INFO L158 Benchmark]: Witness Printer took 5.94ms. Allocated memory is still 142.6MB. Free memory was 55.4MB in the beginning and 54.5MB in the end (delta: 956.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:16:00,094 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.97ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.82ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 94.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.41ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 73.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1756.18ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 55.4MB in the end (delta: 17.6MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Witness Printer took 5.94ms. Allocated memory is still 142.6MB. Free memory was 55.4MB in the beginning and 54.5MB in the end (delta: 956.0kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed short int var_1_7 = 32; [L26] signed short int var_1_8 = 20113; [L27] signed short int var_1_9 = 100; [L28] signed char var_1_10 = 100; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 16; [L31] float var_1_13 = 1.2; [L32] float var_1_14 = 3.6; [L33] float var_1_15 = 5.5; [L34] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L100] COND TRUE k_loop < 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L66] var_1_6 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L67] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L69] var_1_7 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L70] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L73] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L79] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L81] var_1_12 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L82] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L84] var_1_14 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L86] var_1_15 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L102] RET updateVariables() [L103] CALL step() [L38] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L49] COND TRUE var_1_1 == var_1_7 [L50] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L56] COND TRUE \read(var_1_6) [L57] var_1_13 = ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L103] RET step() [L104] CALL, EXPR property() [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93-L94] return ((var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1))) && (var_1_6 ? (var_1_13 == ((float) ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))))) : (var_1_13 == ((float) (var_1_14 - var_1_15)))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 751 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 291 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1890/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:16:00,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:16:01,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:16:02,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:16:02,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:16:02,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:16:02,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:16:02,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:16:02,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:16:02,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:16:02,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:16:02,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:16:02,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:16:02,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:16:02,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:16:02,053 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:16:02,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:16:02,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:16:02,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:16:02,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:16:02,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:16:02,055 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 -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2025-03-03 23:16:02,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:16:02,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:16:02,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:16:02,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:16:02,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:16:02,318 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-97.i [2025-03-03 23:16:03,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3717be7fe/9e6ef78ceb134851941a4a082bfe4712/FLAGd3653c82d [2025-03-03 23:16:03,645 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:16:03,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-03-03 23:16:03,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3717be7fe/9e6ef78ceb134851941a4a082bfe4712/FLAGd3653c82d [2025-03-03 23:16:04,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3717be7fe/9e6ef78ceb134851941a4a082bfe4712 [2025-03-03 23:16:04,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:16:04,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:16:04,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:16:04,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:16:04,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:16:04,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fab1bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04, skipping insertion in model container [2025-03-03 23:16:04,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:16:04,147 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-97.i[915,928] [2025-03-03 23:16:04,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:16:04,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:16:04,210 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-97.i[915,928] [2025-03-03 23:16:04,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:16:04,236 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:16:04,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04 WrapperNode [2025-03-03 23:16:04,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:16:04,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:16:04,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:16:04,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:16:04,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,278 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-03-03 23:16:04,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:16:04,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:16:04,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:16:04,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:16:04,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:16:04,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:16:04,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:16:04,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:16:04,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:16:04,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (1/1) ... [2025-03-03 23:16:04,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:16:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:16:04,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:16:04,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:16:04,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:16:04,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:16:04,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:16:04,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:16:04,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:16:04,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:16:04,440 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:16:04,441 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:16:04,763 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:16:04,763 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:16:04,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:16:04,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:16:04,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:04 BoogieIcfgContainer [2025-03-03 23:16:04,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:16:04,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:16:04,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:16:04,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:16:04,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:16:04" (1/3) ... [2025-03-03 23:16:04,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2795ed0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:04, skipping insertion in model container [2025-03-03 23:16:04,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04" (2/3) ... [2025-03-03 23:16:04,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2795ed0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:04, skipping insertion in model container [2025-03-03 23:16:04,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:04" (3/3) ... [2025-03-03 23:16:04,782 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2025-03-03 23:16:04,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:16:04,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:16:04,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:16:04,847 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;@49d47434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:16:04,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:16:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:16:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 23:16:04,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:04,859 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:16:04,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash -146551709, now seen corresponding path program 1 times [2025-03-03 23:16:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423056782] [2025-03-03 23:16:04,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:16:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:04,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:16:04,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:16:04,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 23:16:05,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 23:16:05,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:05,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:16:05,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 23:16:05,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:16:05,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423056782] [2025-03-03 23:16:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423056782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:16:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:16:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:16:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123776657] [2025-03-03 23:16:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:16:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:05,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:16:05,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:16:05,122 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:16:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:05,140 INFO L93 Difference]: Finished difference Result 94 states and 155 transitions. [2025-03-03 23:16:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:16:05,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-03-03 23:16:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:05,146 INFO L225 Difference]: With dead ends: 94 [2025-03-03 23:16:05,146 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 23:16:05,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:16:05,151 INFO L435 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:16:05,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:16:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 23:16:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 23:16:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:16:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-03-03 23:16:05,201 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 101 [2025-03-03 23:16:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:05,201 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-03-03 23:16:05,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:16:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-03-03 23:16:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 23:16:05,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:16:05,205 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:16:05,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:16:05,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:16:05,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:16:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:16:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1027434949, now seen corresponding path program 1 times [2025-03-03 23:16:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:16:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131071491] [2025-03-03 23:16:05,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:16:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:16:05,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:16:05,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:16:05,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:16:05,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 23:16:05,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 23:16:05,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:16:05,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:16:05,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:16:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates...