./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:07:18,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:07:19,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:07:19,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:07:19,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:07:19,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:07:19,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:07:19,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:07:19,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:07:19,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:07:19,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:07:19,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:07:19,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:07:19,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:07:19,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:07:19,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:07:19,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:07:19,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:07:19,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:07:19,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:07:19,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:07:19,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:07:19,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:07:19,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:07:19,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:07:19,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:07:19,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:07:19,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:07:19,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:07:19,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:07:19,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:07:19,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:07:19,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:19,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:07:19,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:07:19,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:07:19,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:07:19,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:07:19,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:07:19,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:07:19,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:07:19,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:07:19,090 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-10-14 11:07:19,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:07:19,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:07:19,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:07:19,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:07:19,393 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:07:19,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:21,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:07:21,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:07:21,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:21,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b5094d48/d0588719588b43eebd914436416a638a/FLAG424c2f906 [2024-10-14 11:07:21,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b5094d48/d0588719588b43eebd914436416a638a [2024-10-14 11:07:21,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:07:21,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:07:21,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:21,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:07:21,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:07:21,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549af2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21, skipping insertion in model container [2024-10-14 11:07:21,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:07:21,516 WARN L248 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-78.i[916,929] [2024-10-14 11:07:21,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:21,572 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:07:21,582 WARN L248 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-78.i[916,929] [2024-10-14 11:07:21,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:21,616 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:07:21,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21 WrapperNode [2024-10-14 11:07:21,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:21,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:21,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:07:21,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:07:21,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,653 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-14 11:07:21,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:21,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:07:21,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:07:21,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:07:21,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,678 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]. [2024-10-14 11:07:21,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:07:21,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:07:21,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:07:21,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:07:21,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (1/1) ... [2024-10-14 11:07:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:21,723 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) [2024-10-14 11:07:21,732 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 [2024-10-14 11:07:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:07:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:07:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:07:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:07:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:07:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:07:21,831 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:07:21,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:07:21,978 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 11:07:21,978 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:07:22,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:07:22,013 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:07:22,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:22 BoogieIcfgContainer [2024-10-14 11:07:22,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:07:22,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:07:22,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:07:22,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:07:22,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:07:21" (1/3) ... [2024-10-14 11:07:22,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e5b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:22, skipping insertion in model container [2024-10-14 11:07:22,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:21" (2/3) ... [2024-10-14 11:07:22,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e5b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:22, skipping insertion in model container [2024-10-14 11:07:22,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:22" (3/3) ... [2024-10-14 11:07:22,022 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:22,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:07:22,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:07:22,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:07:22,103 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;@7c65953f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:07:22,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:07:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:07:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:22,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:22,119 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:22,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1407298392, now seen corresponding path program 1 times [2024-10-14 11:07:22,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156427591] [2024-10-14 11:07:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:07:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156427591] [2024-10-14 11:07:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156427591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:22,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:22,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:07:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827912046] [2024-10-14 11:07:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:22,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:07:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:07:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:22,610 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:07:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:22,640 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-14 11:07:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:07:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-14 11:07:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:22,650 INFO L225 Difference]: With dead ends: 81 [2024-10-14 11:07:22,650 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 11:07:22,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:22,656 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:22,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:07:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 11:07:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 11:07:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:07:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-14 11:07:22,702 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2024-10-14 11:07:22,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:22,703 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-14 11:07:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:07:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-14 11:07:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:22,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:22,707 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:22,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:07:22,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:22,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1413022232, now seen corresponding path program 1 times [2024-10-14 11:07:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:22,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641338044] [2024-10-14 11:07:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:07:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641338044] [2024-10-14 11:07:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641338044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:07:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123257073] [2024-10-14 11:07:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:23,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:07:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:07:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:07:23,141 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:23,218 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2024-10-14 11:07:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:07:23,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-14 11:07:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:23,222 INFO L225 Difference]: With dead ends: 118 [2024-10-14 11:07:23,223 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 11:07:23,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:07:23,224 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 28 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:23,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 155 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:07:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 11:07:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-14 11:07:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 11:07:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-10-14 11:07:23,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 88 [2024-10-14 11:07:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:23,256 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-10-14 11:07:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-10-14 11:07:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:23,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:23,262 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:07:23,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1412962650, now seen corresponding path program 1 times [2024-10-14 11:07:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274944817] [2024-10-14 11:07:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:07:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:07:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:07:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:07:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:07:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:07:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:07:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:07:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:07:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:07:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:07:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:07:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:07:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:07:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:07:24,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:07:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274944817] [2024-10-14 11:07:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274944817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:07:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206299377] [2024-10-14 11:07:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:07:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:07:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:07:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:07:24,584 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:25,014 INFO L93 Difference]: Finished difference Result 145 states and 197 transitions. [2024-10-14 11:07:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 11:07:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-14 11:07:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:25,017 INFO L225 Difference]: With dead ends: 145 [2024-10-14 11:07:25,018 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 11:07:25,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:07:25,019 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 124 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:25,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 303 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:07:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 11:07:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2024-10-14 11:07:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:07:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2024-10-14 11:07:25,057 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 88 [2024-10-14 11:07:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:25,059 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2024-10-14 11:07:25,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2024-10-14 11:07:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:25,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:25,061 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:07:25,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -732904280, now seen corresponding path program 1 times [2024-10-14 11:07:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:07:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013771827] [2024-10-14 11:07:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:07:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:25,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:07:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:25,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:07:25,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:07:25,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:07:25,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:07:25,146 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 11:07:25,202 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:07:25,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:07:25 BoogieIcfgContainer [2024-10-14 11:07:25,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:07:25,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:07:25,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:07:25,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:07:25,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:22" (3/4) ... [2024-10-14 11:07:25,211 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:07:25,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:07:25,212 INFO L158 Benchmark]: Toolchain (without parser) took 3904.62ms. Allocated memory was 213.9MB in the beginning and 295.7MB in the end (delta: 81.8MB). Free memory was 145.1MB in the beginning and 164.9MB in the end (delta: -19.8MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,212 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:25,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.25ms. Allocated memory is still 213.9MB. Free memory was 144.8MB in the beginning and 131.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 213.9MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,213 INFO L158 Benchmark]: Boogie Preprocessor took 34.37ms. Allocated memory is still 213.9MB. Free memory was 129.8MB in the beginning and 127.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,214 INFO L158 Benchmark]: RCFGBuilder took 324.44ms. Allocated memory is still 213.9MB. Free memory was 127.2MB in the beginning and 109.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,214 INFO L158 Benchmark]: TraceAbstraction took 3193.01ms. Allocated memory was 213.9MB in the beginning and 295.7MB in the end (delta: 81.8MB). Free memory was 109.0MB in the beginning and 164.9MB in the end (delta: -56.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-14 11:07:25,214 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 295.7MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:07:25,216 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.15ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.25ms. Allocated memory is still 213.9MB. Free memory was 144.8MB in the beginning and 131.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 213.9MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.37ms. Allocated memory is still 213.9MB. Free memory was 129.8MB in the beginning and 127.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 324.44ms. Allocated memory is still 213.9MB. Free memory was 127.2MB in the beginning and 109.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3193.01ms. Allocated memory was 213.9MB in the beginning and 295.7MB in the end (delta: 81.8MB). Free memory was 109.0MB in the beginning and 164.9MB in the end (delta: -56.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 295.7MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_9 = 100; [L26] signed long int var_1_10 = 4; [L27] signed long int var_1_11 = 128; [L28] signed long int var_1_12 = 128; [L29] signed long int var_1_13 = 0; [L30] signed long int var_1_14 = 127; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L71] var_1_10 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L72] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L75] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L78] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L80] var_1_14 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L98] RET updateVariables() [L99] CALL step() [L36] COND FALSE !(0.8f > (- var_1_10)) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-256, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_10=1, var_1_11=1, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=1, var_1_12=2147483646, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2147483646, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=2147483646, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=254, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 191 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:07:25,250 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:07:27,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:07:27,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:07:27,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:07:27,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:07:27,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:07:27,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:07:27,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:07:27,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:07:27,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:07:27,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:07:27,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:07:27,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:07:27,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:07:27,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:07:27,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:07:27,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:07:27,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:07:27,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:07:27,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:07:27,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:07:27,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:07:27,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:07:27,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:07:27,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:07:27,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:07:27,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:07:27,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:07:27,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:07:27,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:07:27,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:07:27,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:07:27,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:07:27,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:07:27,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:27,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:07:27,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:07:27,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:07:27,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:07:27,630 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:27,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:07:27,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:07:27,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:07:27,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:07:27,632 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:07:27,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-10-14 11:07:27,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:07:27,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:07:27,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:07:27,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:07:27,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:07:27,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:29,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:07:29,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:07:29,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:29,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df69c1fa/539ab655d0f24a328a4be868c69661a0/FLAGe30f8ccd3 [2024-10-14 11:07:29,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9df69c1fa/539ab655d0f24a328a4be868c69661a0 [2024-10-14 11:07:29,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:07:29,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:07:29,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:29,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:07:29,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:07:29,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:29" (1/1) ... [2024-10-14 11:07:29,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f75565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:29, skipping insertion in model container [2024-10-14 11:07:29,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:07:29" (1/1) ... [2024-10-14 11:07:29,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:07:30,029 WARN L248 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-78.i[916,929] [2024-10-14 11:07:30,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:30,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:07:30,116 WARN L248 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-78.i[916,929] [2024-10-14 11:07:30,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:07:30,169 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:07:30,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30 WrapperNode [2024-10-14 11:07:30,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:07:30,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:30,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:07:30,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:07:30,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,225 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-10-14 11:07:30,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:07:30,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:07:30,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:07:30,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:07:30,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,255 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]. [2024-10-14 11:07:30,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:07:30,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:07:30,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:07:30,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:07:30,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (1/1) ... [2024-10-14 11:07:30,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:07:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:07:30,325 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) [2024-10-14 11:07:30,332 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 [2024-10-14 11:07:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:07:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:07:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:07:30,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:07:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:07:30,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:07:30,465 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:07:30,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:07:32,753 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 11:07:32,754 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:07:32,797 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:07:32,798 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:07:32,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:32 BoogieIcfgContainer [2024-10-14 11:07:32,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:07:32,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:07:32,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:07:32,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:07:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:07:29" (1/3) ... [2024-10-14 11:07:32,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328825de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:32, skipping insertion in model container [2024-10-14 11:07:32,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:07:30" (2/3) ... [2024-10-14 11:07:32,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328825de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:07:32, skipping insertion in model container [2024-10-14 11:07:32,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:07:32" (3/3) ... [2024-10-14 11:07:32,805 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-10-14 11:07:32,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:07:32,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:07:32,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:07:32,877 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;@6c64b3c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:07:32,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:07:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:07:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:32,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:32,892 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:32,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1407298392, now seen corresponding path program 1 times [2024-10-14 11:07:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940902556] [2024-10-14 11:07:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:32,911 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 [2024-10-14 11:07:32,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:32,914 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) [2024-10-14 11:07:32,915 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 [2024-10-14 11:07:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:33,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:07:33,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 11:07:33,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:07:33,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940902556] [2024-10-14 11:07:33,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940902556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:33,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:33,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:07:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372135214] [2024-10-14 11:07:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:33,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:07:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:07:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:07:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:33,173 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:07:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:34,937 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-14 11:07:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:07:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-14 11:07:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:34,970 INFO L225 Difference]: With dead ends: 81 [2024-10-14 11:07:34,970 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 11:07:34,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:07:34,975 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:34,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 11:07:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 11:07:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 11:07:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 11:07:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-14 11:07:35,007 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 88 [2024-10-14 11:07:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:35,007 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-14 11:07:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 11:07:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-14 11:07:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:35,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:35,011 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:35,019 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 [2024-10-14 11:07:35,212 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 [2024-10-14 11:07:35,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1413022232, now seen corresponding path program 1 times [2024-10-14 11:07:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951807153] [2024-10-14 11:07:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:35,214 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 [2024-10-14 11:07:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:35,216 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) [2024-10-14 11:07:35,217 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 [2024-10-14 11:07:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:35,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:07:35,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:07:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 11:07:35,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:07:35,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:07:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951807153] [2024-10-14 11:07:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951807153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:07:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:07:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:07:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961905602] [2024-10-14 11:07:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:07:35,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:07:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:07:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:07:35,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:07:35,903 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:37,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:39,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:07:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:07:39,832 INFO L93 Difference]: Finished difference Result 118 states and 175 transitions. [2024-10-14 11:07:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:07:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-14 11:07:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:07:39,839 INFO L225 Difference]: With dead ends: 118 [2024-10-14 11:07:39,841 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 11:07:39,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:07:39,843 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:07:39,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 155 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 11:07:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 11:07:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-10-14 11:07:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 11:07:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-10-14 11:07:39,870 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 88 [2024-10-14 11:07:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:07:39,871 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-10-14 11:07:39,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 11:07:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-10-14 11:07:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 11:07:39,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:07:39,873 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:07:39,881 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 [2024-10-14 11:07:40,076 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 [2024-10-14 11:07:40,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:07:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:07:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1412962650, now seen corresponding path program 1 times [2024-10-14 11:07:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:07:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853670556] [2024-10-14 11:07:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:40,082 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 [2024-10-14 11:07:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:07:40,085 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) [2024-10-14 11:07:40,087 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 [2024-10-14 11:07:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:40,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:07:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:07:40,355 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-14 11:07:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc5 [1725353954] [2024-10-14 11:07:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:07:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 11:07:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 11:07:40,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 11:07:40,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-14 11:07:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:07:40,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 11:07:40,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:08:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-14 11:08:32,659 INFO L311 TraceCheckSpWp]: Computing backward predicates...