./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.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 a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:44:01,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:44:01,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:44:01,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:44:01,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:44:01,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:44:01,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:44:01,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:44:01,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:44:01,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:44:01,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:44:01,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:44:01,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:44:01,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:44:01,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:44:01,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:44:01,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:44:01,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:01,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:44:01,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:44:01,821 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 -> a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 [2025-03-08 13:44:02,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:44:02,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:44:02,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:44:02,077 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:44:02,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:44:02,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:03,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b85423c2/a7030a9eea32448c9c48ff971987ea46/FLAG3cb38e9c2 [2025-03-08 13:44:03,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:44:03,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:03,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b85423c2/a7030a9eea32448c9c48ff971987ea46/FLAG3cb38e9c2 [2025-03-08 13:44:03,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b85423c2/a7030a9eea32448c9c48ff971987ea46 [2025-03-08 13:44:03,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:44:03,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:44:03,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:03,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:44:03,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:44:03,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:03" (1/1) ... [2025-03-08 13:44:03,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:03, skipping insertion in model container [2025-03-08 13:44:03,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:03" (1/1) ... [2025-03-08 13:44:03,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:44:03,989 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_floatingpointinfluence_no-floats_file-14.i[916,929] [2025-03-08 13:44:04,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:04,028 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:44:04,035 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_floatingpointinfluence_no-floats_file-14.i[916,929] [2025-03-08 13:44:04,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:04,062 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:44:04,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04 WrapperNode [2025-03-08 13:44:04,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:04,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:04,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:44:04,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:44:04,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,102 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-08 13:44:04,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:04,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:44:04,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:44:04,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:44:04,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,130 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:44:04,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,135 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:44:04,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:44:04,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:44:04,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:44:04,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (1/1) ... [2025-03-08 13:44:04,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:04,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:44:04,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:44:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:44:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:44:04,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:44:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:44:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:44:04,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:44:04,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:44:04,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:44:04,452 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:44:04,452 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:44:04,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:44:04,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:44:04,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:04 BoogieIcfgContainer [2025-03-08 13:44:04,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:44:04,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:44:04,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:44:04,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:44:04,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:44:03" (1/3) ... [2025-03-08 13:44:04,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d18a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:04, skipping insertion in model container [2025-03-08 13:44:04,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:04" (2/3) ... [2025-03-08 13:44:04,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d18a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:04, skipping insertion in model container [2025-03-08 13:44:04,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:04" (3/3) ... [2025-03-08 13:44:04,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:04,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:44:04,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-14.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:44:04,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:44:04,537 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;@69fc9787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:44:04,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:44:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:44:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:04,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:04,554 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:04,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:04,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1296636926, now seen corresponding path program 1 times [2025-03-08 13:44:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235028465] [2025-03-08 13:44:04,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:04,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 13:44:04,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235028465] [2025-03-08 13:44:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235028465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:44:04,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763365240] [2025-03-08 13:44:04,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:04,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:04,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:04,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:44:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:04,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:04,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-08 13:44:05,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763365240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:44:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:44:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290467010] [2025-03-08 13:44:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:05,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:05,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:05,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:05,044 INFO L87 Difference]: Start difference. First operand has 61 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:05,060 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2025-03-08 13:44:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2025-03-08 13:44:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:05,067 INFO L225 Difference]: With dead ends: 116 [2025-03-08 13:44:05,067 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 13:44:05,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:05,071 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:05,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 13:44:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 13:44:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:44:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-08 13:44:05,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 151 [2025-03-08 13:44:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:05,109 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-08 13:44:05,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-08 13:44:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:05,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:05,113 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:05,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:44:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:44:05,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash -572410147, now seen corresponding path program 1 times [2025-03-08 13:44:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-08 13:44:05,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:05,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:05,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:05,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032784114] [2025-03-08 13:44:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032784114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:44:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089991735] [2025-03-08 13:44:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:44:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:05,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:44:05,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:44:05,761 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:05,942 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2025-03-08 13:44:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:44:05,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2025-03-08 13:44:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:05,944 INFO L225 Difference]: With dead ends: 169 [2025-03-08 13:44:05,945 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 13:44:05,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:44:05,947 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:05,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 241 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:44:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 13:44:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-03-08 13:44:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:44:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-08 13:44:05,976 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 151 [2025-03-08 13:44:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-08 13:44:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-08 13:44:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:05,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:05,978 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:05,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:44:05,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:05,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:05,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1915102686, now seen corresponding path program 1 times [2025-03-08 13:44:05,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:05,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-03-08 13:44:05,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:05,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-03-08 13:44:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409978404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:08,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:44:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994855] [2025-03-08 13:44:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:44:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:08,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:44:08,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:44:08,376 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:08,830 INFO L93 Difference]: Finished difference Result 140 states and 200 transitions. [2025-03-08 13:44:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:44:08,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2025-03-08 13:44:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:08,834 INFO L225 Difference]: With dead ends: 140 [2025-03-08 13:44:08,834 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 13:44:08,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:44:08,835 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 69 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:08,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 351 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 13:44:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2025-03-08 13:44:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:44:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2025-03-08 13:44:08,860 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 151 [2025-03-08 13:44:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:08,861 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2025-03-08 13:44:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2025-03-08 13:44:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:08,864 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:44:08,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:08,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1916026207, now seen corresponding path program 1 times [2025-03-08 13:44:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798904773] [2025-03-08 13:44:08,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:08,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:08,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:10,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798904773] [2025-03-08 13:44:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798904773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:44:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230831997] [2025-03-08 13:44:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:10,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:44:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:10,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:44:10,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:44:10,943 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:11,300 INFO L93 Difference]: Finished difference Result 152 states and 217 transitions. [2025-03-08 13:44:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:44:11,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2025-03-08 13:44:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:11,303 INFO L225 Difference]: With dead ends: 152 [2025-03-08 13:44:11,305 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 13:44:11,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:44:11,305 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 77 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:11,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 13:44:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2025-03-08 13:44:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 13:44:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-03-08 13:44:11,330 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 151 [2025-03-08 13:44:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:11,330 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-03-08 13:44:11,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-03-08 13:44:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:11,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:11,334 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:44:11,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:11,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1027599005, now seen corresponding path program 1 times [2025-03-08 13:44:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379341504] [2025-03-08 13:44:11,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:11,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:11,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:12,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379341504] [2025-03-08 13:44:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379341504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:12,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:44:12,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381303650] [2025-03-08 13:44:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:12,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:44:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:12,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:44:12,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:44:12,759 INFO L87 Difference]: Start difference. First operand 127 states and 188 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:13,032 INFO L93 Difference]: Finished difference Result 156 states and 221 transitions. [2025-03-08 13:44:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:44:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2025-03-08 13:44:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:13,034 INFO L225 Difference]: With dead ends: 156 [2025-03-08 13:44:13,034 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 13:44:13,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:44:13,035 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 49 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:13,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 325 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:44:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 13:44:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129. [2025-03-08 13:44:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 69 states have (on average 1.144927536231884) internal successors, (79), 70 states have internal predecessors, (79), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 13:44:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2025-03-08 13:44:13,061 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 151 [2025-03-08 13:44:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2025-03-08 13:44:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2025-03-08 13:44:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:13,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:13,065 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:44:13,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:13,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1028522526, now seen corresponding path program 1 times [2025-03-08 13:44:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68846119] [2025-03-08 13:44:13,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:13,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:13,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:13,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:13,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68846119] [2025-03-08 13:44:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68846119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:44:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890635203] [2025-03-08 13:44:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:44:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:14,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:44:14,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:44:14,991 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:16,410 INFO L93 Difference]: Finished difference Result 169 states and 239 transitions. [2025-03-08 13:44:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:44:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2025-03-08 13:44:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:16,412 INFO L225 Difference]: With dead ends: 169 [2025-03-08 13:44:16,412 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 13:44:16,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:44:16,413 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 138 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:16,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 401 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:44:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 13:44:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 127. [2025-03-08 13:44:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 13:44:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-03-08 13:44:16,429 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 151 [2025-03-08 13:44:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-03-08 13:44:16,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-03-08 13:44:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 13:44:16,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:16,432 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:16,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:44:16,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:16,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1007247720, now seen corresponding path program 1 times [2025-03-08 13:44:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092539276] [2025-03-08 13:44:16,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:16,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:44:16,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:44:16,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:16,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 13:44:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092539276] [2025-03-08 13:44:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092539276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:44:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903582483] [2025-03-08 13:44:16,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:16,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:16,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:44:16,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:44:16,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:44:16,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:16,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:16,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 13:44:16,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 42 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-03-08 13:44:16,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:44:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 13:44:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903582483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:44:17,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:44:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-08 13:44:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706497750] [2025-03-08 13:44:17,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:44:17,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:44:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:17,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:44:17,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:44:17,026 INFO L87 Difference]: Start difference. First operand 127 states and 188 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 13:44:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:17,245 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-08 13:44:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:44:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 152 [2025-03-08 13:44:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:17,248 INFO L225 Difference]: With dead ends: 218 [2025-03-08 13:44:17,248 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 13:44:17,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:44:17,249 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 171 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:17,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 159 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:44:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 13:44:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2025-03-08 13:44:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 13:44:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2025-03-08 13:44:17,268 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 152 [2025-03-08 13:44:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2025-03-08 13:44:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 13:44:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2025-03-08 13:44:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 13:44:17,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:17,272 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:17,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:44:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 13:44:17,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1008171241, now seen corresponding path program 1 times [2025-03-08 13:44:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732744405] [2025-03-08 13:44:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:44:17,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:44:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:44:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248676605] [2025-03-08 13:44:17,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:17,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:17,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 13:44:17,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:44:17,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:44:17,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:17,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:17,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:44:17,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 13:44:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 13:44:17,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:17,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:17,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:44:17,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:44:17,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:44:17,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:44:18,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:18,097 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:18,158 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:44:18,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:44:18 BoogieIcfgContainer [2025-03-08 13:44:18,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:44:18,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:44:18,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:44:18,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:44:18,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:04" (3/4) ... [2025-03-08 13:44:18,167 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:44:18,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:44:18,168 INFO L158 Benchmark]: Toolchain (without parser) took 14299.10ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 105.7MB in the beginning and 396.3MB in the end (delta: -290.6MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2025-03-08 13:44:18,168 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:18,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.00ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.9MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:44:18,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.38ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:18,168 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:18,168 INFO L158 Benchmark]: IcfgBuilder took 321.24ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.7MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:44:18,169 INFO L158 Benchmark]: TraceAbstraction took 13700.48ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 67.7MB in the beginning and 396.4MB in the end (delta: -328.7MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2025-03-08 13:44:18,169 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 587.2MB. Free memory was 396.4MB in the beginning and 396.3MB in the end (delta: 189.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:44:18,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.00ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 92.9MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.38ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 87.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.24ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.7MB in the end (delta: 18.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13700.48ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 67.7MB in the beginning and 396.4MB in the end (delta: -328.7MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 587.2MB. Free memory was 396.4MB in the beginning and 396.3MB in the end (delta: 189.3kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] signed long int var_1_13 = 32; [L34] signed long int var_1_14 = 15; [L35] signed long int var_1_15 = 256; [L36] signed long int var_1_16 = 8; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L91] var_1_14 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L102] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L103] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=-64, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L117] RET updateVariables() [L118] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L47] COND TRUE (var_1_13 / var_1_14) <= var_1_15 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=2, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L48] COND TRUE (var_1_16 - 2.3) > var_1_14 [L49] var_1_12 = (var_1_17 - var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L56] COND FALSE !(((var_1_5 >= var_1_12) && var_1_2) && var_1_3) [L59] var_1_9 = (! (var_1_11 || var_1_10)) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L118] RET step() [L119] CALL, EXPR property() [L109-L110] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=-255, var_1_12=16384, var_1_13=1, var_1_14=2, var_1_15=0, var_1_16=0, var_1_17=163839, var_1_1=1000000, var_1_2=-255, var_1_3=-255, var_1_5=17, var_1_6=-32767, var_1_7=16383, var_1_8=16382, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 117 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 572 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 1945 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1364 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 581 mSDtfsCounter, 982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 135 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1665 NumberOfCodeBlocks, 1665 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 5181 SizeOfPredicates, 3 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 11826/12000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:44:18,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.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 a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:44:19,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:44:20,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:44:20,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:44:20,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:44:20,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:44:20,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:44:20,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:44:20,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:44:20,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:44:20,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:44:20,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:44:20,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:44:20,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:20,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:44:20,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:44:20,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:44:20,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:44:20,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:44:20,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:44:20,060 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 -> a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 [2025-03-08 13:44:20,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:44:20,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:44:20,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:44:20,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:44:20,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:44:20,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:21,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38381cb/24cb118e25f344e3b60ef6556d052bbc/FLAG7d48bb540 [2025-03-08 13:44:21,642 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:44:21,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:21,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38381cb/24cb118e25f344e3b60ef6556d052bbc/FLAG7d48bb540 [2025-03-08 13:44:21,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38381cb/24cb118e25f344e3b60ef6556d052bbc [2025-03-08 13:44:21,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:44:21,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:44:21,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:21,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:44:21,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:44:21,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9fecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21, skipping insertion in model container [2025-03-08 13:44:21,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:44:21,797 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_floatingpointinfluence_no-floats_file-14.i[916,929] [2025-03-08 13:44:21,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:21,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:44:21,859 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_floatingpointinfluence_no-floats_file-14.i[916,929] [2025-03-08 13:44:21,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:21,900 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:44:21,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21 WrapperNode [2025-03-08 13:44:21,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:21,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:21,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:44:21,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:44:21,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,937 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-08 13:44:21,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:21,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:44:21,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:44:21,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:44:21,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,964 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:44:21,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:44:21,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:44:21,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:44:21,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:44:21,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (1/1) ... [2025-03-08 13:44:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:22,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:44:22,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:44:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:44:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:44:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:44:22,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:44:22,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:44:22,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:44:22,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:44:22,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:44:25,374 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 13:44:25,374 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:44:25,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:44:25,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:44:25,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:25 BoogieIcfgContainer [2025-03-08 13:44:25,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:44:25,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:44:25,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:44:25,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:44:25,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:44:21" (1/3) ... [2025-03-08 13:44:25,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3bba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:25, skipping insertion in model container [2025-03-08 13:44:25,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:21" (2/3) ... [2025-03-08 13:44:25,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3bba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:25, skipping insertion in model container [2025-03-08 13:44:25,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:25" (3/3) ... [2025-03-08 13:44:25,388 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-14.i [2025-03-08 13:44:25,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:44:25,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-14.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:44:25,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:44:25,443 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;@178fdc3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:44:25,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:44:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:44:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:25,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:25,455 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:25,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1296636926, now seen corresponding path program 1 times [2025-03-08 13:44:25,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:25,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745350292] [2025-03-08 13:44:25,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:25,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:25,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:25,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:44:25,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:25,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:25,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:25,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:25,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:25,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 13:44:25,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:25,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745350292] [2025-03-08 13:44:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745350292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:44:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635422411] [2025-03-08 13:44:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:25,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:25,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:25,747 INFO L87 Difference]: Start difference. First operand has 61 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:25,763 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2025-03-08 13:44:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2025-03-08 13:44:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:25,768 INFO L225 Difference]: With dead ends: 116 [2025-03-08 13:44:25,768 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 13:44:25,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:25,772 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:25,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 13:44:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 13:44:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 13:44:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2025-03-08 13:44:25,803 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 151 [2025-03-08 13:44:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2025-03-08 13:44:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 13:44:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2025-03-08 13:44:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:25,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:25,807 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:25,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:44:26,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:26,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:26,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -572410147, now seen corresponding path program 1 times [2025-03-08 13:44:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020828396] [2025-03-08 13:44:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:26,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:26,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:26,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:26,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:44:26,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:26,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:26,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:26,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:26,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:44:26,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-08 13:44:26,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:26,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020828396] [2025-03-08 13:44:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020828396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:26,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:44:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798439310] [2025-03-08 13:44:26,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:26,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:44:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:26,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:44:26,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:44:26,772 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:28,729 INFO L93 Difference]: Finished difference Result 172 states and 262 transitions. [2025-03-08 13:44:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:44:28,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2025-03-08 13:44:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:28,752 INFO L225 Difference]: With dead ends: 172 [2025-03-08 13:44:28,752 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 13:44:28,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:44:28,753 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 46 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:28,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 245 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 13:44:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 13:44:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2025-03-08 13:44:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:44:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-03-08 13:44:28,782 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 151 [2025-03-08 13:44:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:28,785 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-03-08 13:44:28,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-08 13:44:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-03-08 13:44:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:28,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:28,787 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:28,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:44:28,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:28,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:28,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1915102686, now seen corresponding path program 1 times [2025-03-08 13:44:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:28,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027153105] [2025-03-08 13:44:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:28,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:28,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:28,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:44:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:29,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:29,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:29,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:44:29,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 42 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-03-08 13:44:29,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:44:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-08 13:44:29,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027153105] [2025-03-08 13:44:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027153105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:44:29,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:44:29,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 13:44:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960049584] [2025-03-08 13:44:29,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:44:29,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:44:29,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:29,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:44:29,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:44:29,875 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 13:44:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:31,378 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-03-08 13:44:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:44:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 151 [2025-03-08 13:44:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:31,402 INFO L225 Difference]: With dead ends: 169 [2025-03-08 13:44:31,402 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 13:44:31,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:44:31,403 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:31,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 108 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 13:44:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 13:44:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2025-03-08 13:44:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:44:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-08 13:44:31,420 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 151 [2025-03-08 13:44:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:31,420 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-08 13:44:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 13:44:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-08 13:44:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 13:44:31,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:31,423 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:31,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 13:44:31,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:31,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:31,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1916026207, now seen corresponding path program 1 times [2025-03-08 13:44:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554681040] [2025-03-08 13:44:31,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:31,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:31,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 13:44:31,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 13:44:31,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 13:44:31,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:31,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:31,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 13:44:31,789 INFO L279 TraceCheckSpWp]: Computing forward predicates...