./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.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 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:46:17,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:46:17,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:46:17,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:46:17,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:46:17,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:46:17,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:46:17,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:46:17,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:46:17,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:46:17,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:46:17,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:46:17,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:46:17,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:46:17,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:46:17,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:46:17,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:46:17,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:46:17,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:46:17,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:46:17,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:46:17,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:46:17,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:46:17,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:46:17,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:46:17,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:46:17,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:46:17,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:46:17,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:46:17,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:46:17,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:46:17,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:46:17,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:46:17,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:46:17,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:46:17,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:46:17,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:46:17,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:46:17,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:46:17,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:46:17,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:46:17,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:46:17,575 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 -> 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d [2024-11-16 15:46:17,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:46:17,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:46:17,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:46:17,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:46:17,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:46:17,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:19,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:46:19,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:46:19,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:19,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870a1aa79/12da9c519b37490fa015c9a4e5003497/FLAG6f1530e1d [2024-11-16 15:46:19,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870a1aa79/12da9c519b37490fa015c9a4e5003497 [2024-11-16 15:46:19,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:46:19,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:46:19,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:46:19,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:46:19,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:46:19,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:19,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23895e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19, skipping insertion in model container [2024-11-16 15:46:19,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:19,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:46:19,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-16 15:46:19,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:46:19,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:46:19,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-16 15:46:19,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:46:19,944 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:46:19,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19 WrapperNode [2024-11-16 15:46:19,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:46:19,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:46:19,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:46:19,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:46:19,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:19,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,015 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 15:46:20,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:46:20,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:46:20,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:46:20,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:46:20,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,069 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-11-16 15:46:20,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:46:20,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:46:20,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:46:20,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:46:20,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (1/1) ... [2024-11-16 15:46:20,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:46:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:46:20,127 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-11-16 15:46:20,134 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-11-16 15:46:20,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:46:20,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:46:20,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:46:20,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:46:20,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:46:20,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:46:20,276 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:46:20,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:46:20,539 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:46:20,539 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:46:20,558 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:46:20,558 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:46:20,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:46:20 BoogieIcfgContainer [2024-11-16 15:46:20,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:46:20,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:46:20,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:46:20,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:46:20,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:46:19" (1/3) ... [2024-11-16 15:46:20,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaf6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:46:20, skipping insertion in model container [2024-11-16 15:46:20,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:19" (2/3) ... [2024-11-16 15:46:20,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaf6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:46:20, skipping insertion in model container [2024-11-16 15:46:20,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:46:20" (3/3) ... [2024-11-16 15:46:20,572 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:20,587 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:46:20,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:46:20,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:46:20,660 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;@639d5529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:46:20,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:46:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:46:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:46:20,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:46:20,679 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:46:20,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:46:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:46:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1855559903, now seen corresponding path program 1 times [2024-11-16 15:46:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:46:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35579242] [2024-11-16 15:46:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:46:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:46:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:46:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:46:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:46:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:46:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:46:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:46:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:46:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:46:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:46:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:46:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:46:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:46:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:46:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:46:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:46:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:46:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:46:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:46:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:46:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:46:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:46:21,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:46:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35579242] [2024-11-16 15:46:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35579242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:46:21,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:46:21,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:46:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954310706] [2024-11-16 15:46:21,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:46:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:46:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:46:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:46:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:46:21,149 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:46:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:46:21,177 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2024-11-16 15:46:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:46:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-16 15:46:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:46:21,192 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:46:21,192 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:46:21,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11-16 15:46:21,204 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:46:21,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:46:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:46:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:46:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:46:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-16 15:46:21,251 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 126 [2024-11-16 15:46:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:46:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-16 15:46:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:46:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-16 15:46:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:46:21,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:46:21,256 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:46:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:46:21,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:46:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:46:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 353717471, now seen corresponding path program 1 times [2024-11-16 15:46:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:46:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752862358] [2024-11-16 15:46:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:46:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:46:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:46:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:46:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:46:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:46:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:46:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:46:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:46:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:46:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:46:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:46:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:46:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:46:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:46:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:46:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:46:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:46:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:46:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:46:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:46:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:46:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:46:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:46:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752862358] [2024-11-16 15:46:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752862358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:46:25,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:46:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:46:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469199777] [2024-11-16 15:46:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:46:25,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:46:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:46:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:46:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:46:25,202 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:46:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:46:25,520 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2024-11-16 15:46:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:46:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-16 15:46:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:46:25,523 INFO L225 Difference]: With dead ends: 82 [2024-11-16 15:46:25,523 INFO L226 Difference]: Without dead ends: 79 [2024-11-16 15:46:25,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:46:25,525 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 26 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:46:25,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 358 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:46:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-16 15:46:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2024-11-16 15:46:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:46:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-16 15:46:25,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 126 [2024-11-16 15:46:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:46:25,548 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-16 15:46:25,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:46:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-16 15:46:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:46:25,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:46:25,556 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:46:25,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:46:25,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:46:25,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:46:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 382346622, now seen corresponding path program 1 times [2024-11-16 15:46:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:46:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938529218] [2024-11-16 15:46:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:46:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:46:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:46:25,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:46:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:46:25,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:46:25,745 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:46:25,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:46:25,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:46:25,751 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:46:25,846 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:46:25,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:46:25 BoogieIcfgContainer [2024-11-16 15:46:25,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:46:25,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:46:25,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:46:25,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:46:25,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:46:20" (3/4) ... [2024-11-16 15:46:25,857 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:46:25,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:46:25,861 INFO L158 Benchmark]: Toolchain (without parser) took 6241.63ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 136.7MB in the beginning and 168.9MB in the end (delta: -32.3MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,864 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 100.7MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:46:25,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.38ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 122.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 119.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,865 INFO L158 Benchmark]: Boogie Preprocessor took 71.01ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 114.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,865 INFO L158 Benchmark]: IcfgBuilder took 469.44ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 126.6MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,865 INFO L158 Benchmark]: TraceAbstraction took 5290.10ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 125.5MB in the beginning and 168.9MB in the end (delta: -43.4MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-11-16 15:46:25,866 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 295.7MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:46:25,871 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.62ms. Allocated memory is still 100.7MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.38ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 122.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.01ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 119.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.01ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 114.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 469.44ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 126.6MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5290.10ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 125.5MB in the beginning and 168.9MB in the end (delta: -43.4MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 295.7MB. Free memory is still 168.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 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed long int var_1_2 = 50; [L24] signed long int var_1_3 = 7; [L25] signed char var_1_7 = 10; [L26] signed long int var_1_8 = 32; [L27] signed long int var_1_9 = 1000000; [L28] signed long int var_1_10 = 2; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=50, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=50, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L70] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L71] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L71] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=7, var_1_7=10, var_1_8=32, var_1_9=1000000] [L72] var_1_3 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L73] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L74] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L74] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=10, var_1_8=32, var_1_9=1000000] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L76] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L77] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L77] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=1000000] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=2, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L92] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L93] var_1_16 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L95] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=1, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L112] RET updateVariables() [L113] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L49] COND TRUE var_1_8 <= var_1_8 [L50] var_1_11 = (var_1_12 || var_1_13) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=5, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((signed long int) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((signed long int) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=253, var_1_15=254, var_1_16=253, var_1_17=252, var_1_1=-16, var_1_2=0, var_1_3=-1, var_1_7=0, var_1_8=32, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 155 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1520/1520 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-11-16 15:46:25,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.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 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:46:28,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:46:28,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:46:28,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:46:28,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:46:28,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:46:28,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:46:28,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:46:28,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:46:28,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:46:28,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:46:28,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:46:28,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:46:28,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:46:28,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:46:28,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:46:28,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:46:28,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:46:28,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:46:28,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:46:28,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:46:28,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:46:28,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:46:28,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:46:28,261 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:46:28,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:46:28,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:46:28,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:46:28,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:46:28,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:46:28,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:46:28,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:46:28,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:46:28,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:46:28,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:46:28,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:46:28,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:46:28,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:46:28,264 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:46:28,266 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:46:28,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:46:28,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:46:28,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:46:28,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:46:28,268 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 -> 2c04fa9e35f4863ffa3e38fc942000589ae498f8db4e626f7ee6fb3d8c4e793d [2024-11-16 15:46:28,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:46:28,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:46:28,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:46:28,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:46:28,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:46:28,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:30,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:46:30,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:46:30,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:30,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d72be96/11a88ceab682429584371547b987e7d2/FLAGcee473c93 [2024-11-16 15:46:30,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d72be96/11a88ceab682429584371547b987e7d2 [2024-11-16 15:46:30,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:46:30,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:46:30,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:46:30,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:46:30,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:46:30,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:46:30" (1/1) ... [2024-11-16 15:46:30,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bcafd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:30, skipping insertion in model container [2024-11-16 15:46:30,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:46:30" (1/1) ... [2024-11-16 15:46:30,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:46:31,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-16 15:46:31,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:46:31,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:46:31,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-11.i[916,929] [2024-11-16 15:46:31,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:46:31,291 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:46:31,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31 WrapperNode [2024-11-16 15:46:31,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:46:31,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:46:31,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:46:31,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:46:31,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,338 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-16 15:46:31,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:46:31,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:46:31,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:46:31,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:46:31,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,373 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-11-16 15:46:31,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:46:31,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:46:31,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:46:31,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:46:31,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (1/1) ... [2024-11-16 15:46:31,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:46:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:46:31,433 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-11-16 15:46:31,438 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-11-16 15:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:46:31,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:46:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:46:31,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:46:31,548 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:46:31,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:46:45,748 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 15:46:45,748 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:46:45,762 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:46:45,764 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:46:45,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:46:45 BoogieIcfgContainer [2024-11-16 15:46:45,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:46:45,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:46:45,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:46:45,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:46:45,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:46:30" (1/3) ... [2024-11-16 15:46:45,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e82df96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:46:45, skipping insertion in model container [2024-11-16 15:46:45,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:46:31" (2/3) ... [2024-11-16 15:46:45,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e82df96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:46:45, skipping insertion in model container [2024-11-16 15:46:45,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:46:45" (3/3) ... [2024-11-16 15:46:45,772 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-11.i [2024-11-16 15:46:45,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:46:45,787 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:46:45,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:46:45,844 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;@b64ac18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:46:45,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:46:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:46:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:46:45,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:46:45,862 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:46:45,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:46:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:46:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1855559903, now seen corresponding path program 1 times [2024-11-16 15:46:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:46:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802395877] [2024-11-16 15:46:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:46:45,885 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-11-16 15:46:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:46:45,888 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-11-16 15:46:45,889 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-11-16 15:46:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:46,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:46:46,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:46:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-16 15:46:46,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:46:46,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:46:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802395877] [2024-11-16 15:46:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802395877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:46:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:46:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:46:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845981153] [2024-11-16 15:46:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:46:46,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:46:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:46:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:46:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:46:46,419 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:46:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:46:46,450 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2024-11-16 15:46:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:46:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-11-16 15:46:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:46:46,464 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:46:46,464 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:46:46,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-11-16 15:46:46,472 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:46:46,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:46:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:46:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:46:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:46:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-16 15:46:46,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 126 [2024-11-16 15:46:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:46:46,517 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-16 15:46:46,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:46:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-16 15:46:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:46:46,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:46:46,521 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:46:46,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 15:46:46,722 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-11-16 15:46:46,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:46:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:46:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash 353717471, now seen corresponding path program 1 times [2024-11-16 15:46:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:46:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412164521] [2024-11-16 15:46:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:46:46,724 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-11-16 15:46:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:46:46,726 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-11-16 15:46:46,727 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-11-16 15:46:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:46:47,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:46:47,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:46:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-16 15:46:48,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:46:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 15:46:50,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:46:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412164521] [2024-11-16 15:46:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412164521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:46:50,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:46:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-16 15:46:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271716817] [2024-11-16 15:46:50,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:46:50,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:46:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:46:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:46:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:46:50,696 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 15:46:56,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:47:00,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:47:04,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:47:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:47:04,914 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2024-11-16 15:47:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 15:47:05,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 126 [2024-11-16 15:47:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:47:05,009 INFO L225 Difference]: With dead ends: 115 [2024-11-16 15:47:05,009 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 15:47:05,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-16 15:47:05,011 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 101 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 92 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:47:05,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 114 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-11-16 15:47:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 15:47:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-16 15:47:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:47:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2024-11-16 15:47:05,027 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 126 [2024-11-16 15:47:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:47:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2024-11-16 15:47:05,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 15:47:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2024-11-16 15:47:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 15:47:05,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:47:05,032 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 15:47:05,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 15:47:05,232 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-11-16 15:47:05,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:47:05,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:47:05,234 INFO L85 PathProgramCache]: Analyzing trace with hash 382346622, now seen corresponding path program 1 times [2024-11-16 15:47:05,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:47:05,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009100284] [2024-11-16 15:47:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:47:05,235 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-11-16 15:47:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:47:05,236 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-11-16 15:47:05,237 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-11-16 15:47:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:47:05,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 15:47:05,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:47:15,424 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 15:47:23,645 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 15:47:31,777 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 15:47:40,006 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 15:47:44,069 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv1 8) c_~var_1_11~0) (not (bvsge c_~var_1_3~0 c_~var_1_2~0)) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (not (fp.lt (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false [2024-11-16 15:47:48,139 WARN L873 $PredicateComparison]: unable to prove that (and (= (_ bv1 8) c_~var_1_11~0) (not (bvsge c_~var_1_3~0 c_~var_1_2~0)) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (not (fp.lt (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true