./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_has-floats_file-41.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 521a7b23bb41076c0af28c4cc3c2330626cca2c8b416fc98ef78b6e64d1f37d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:42:23,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:42:23,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:42:23,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:42:23,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:42:23,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:42:23,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:42:23,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:42:23,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:42:23,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:42:23,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:42:23,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:42:23,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:42:23,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:42:23,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:42:23,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:42:23,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:42:23,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:42:23,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:42:23,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:42:23,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:42:23,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:42:23,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:42:23,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:42:23,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:42:23,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:42:23,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:42:23,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:42:23,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:42:23,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:42:23,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:42:23,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:42:23,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:42:23,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:42:23,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:42:23,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:42:23,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:42:23,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:42:23,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:42:23,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:42:23,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:42:23,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:42:23,472 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 -> 521a7b23bb41076c0af28c4cc3c2330626cca2c8b416fc98ef78b6e64d1f37d0 [2024-11-10 06:42:23,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:42:23,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:42:23,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:42:23,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:42:23,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:42:23,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:25,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:42:25,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:42:25,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:25,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e147ee0/9ce86b9b948b4bda8587e34d19736f49/FLAGd29baa224 [2024-11-10 06:42:25,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e147ee0/9ce86b9b948b4bda8587e34d19736f49 [2024-11-10 06:42:25,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:42:25,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:42:25,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:42:25,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:42:25,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:42:25,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:42:25" (1/1) ... [2024-11-10 06:42:25,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754f5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:25, skipping insertion in model container [2024-11-10 06:42:25,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:42:25" (1/1) ... [2024-11-10 06:42:25,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:42:26,034 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_has-floats_file-41.i[917,930] [2024-11-10 06:42:26,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:42:26,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:42:26,101 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_has-floats_file-41.i[917,930] [2024-11-10 06:42:26,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:42:26,141 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:42:26,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26 WrapperNode [2024-11-10 06:42:26,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:42:26,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:42:26,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:42:26,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:42:26,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,206 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-10 06:42:26,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:42:26,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:42:26,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:42:26,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:42:26,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,238 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-10 06:42:26,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:42:26,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:42:26,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:42:26,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:42:26,266 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (1/1) ... [2024-11-10 06:42:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:42:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:42:26,316 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-10 06:42:26,322 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-10 06:42:26,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:42:26,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:42:26,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:42:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:42:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:42:26,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:42:26,482 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:42:26,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:42:26,789 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:42:26,789 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:42:26,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:42:26,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:42:26,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:42:26 BoogieIcfgContainer [2024-11-10 06:42:26,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:42:26,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:42:26,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:42:26,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:42:26,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:42:25" (1/3) ... [2024-11-10 06:42:26,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64448b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:42:26, skipping insertion in model container [2024-11-10 06:42:26,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:26" (2/3) ... [2024-11-10 06:42:26,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64448b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:42:26, skipping insertion in model container [2024-11-10 06:42:26,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:42:26" (3/3) ... [2024-11-10 06:42:26,821 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:26,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:42:26,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:42:26,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:42:26,912 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;@61f78d18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:42:26,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:42:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:42:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:42:26,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:42:26,931 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:42:26,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:42:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:42:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1648002553, now seen corresponding path program 1 times [2024-11-10 06:42:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:42:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561780598] [2024-11-10 06:42:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:42:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:42:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:42:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:42:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:42:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:42:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:42:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:42:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:42:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:42:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:42:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:42:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:42:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:42:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:42:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:42:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:42:27,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:42:27,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561780598] [2024-11-10 06:42:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561780598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:42:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:42:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:42:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313350231] [2024-11-10 06:42:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:42:27,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:42:27,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:42:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:42:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:42:27,389 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:42:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:42:27,425 INFO L93 Difference]: Finished difference Result 94 states and 153 transitions. [2024-11-10 06:42:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:42:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-10 06:42:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:42:27,439 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:42:27,439 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:42:27,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:42:27,447 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:42:27,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:42:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:42:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:42:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:42:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:42:27,497 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 94 [2024-11-10 06:42:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:42:27,497 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:42:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 06:42:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:42:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:42:27,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:42:27,507 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:42:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:42:27,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:42:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:42:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1517194117, now seen corresponding path program 1 times [2024-11-10 06:42:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:42:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952011498] [2024-11-10 06:42:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:42:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:42:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:42:27,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:42:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:42:27,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:42:27,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:42:27,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:42:27,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:42:27,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 06:42:27,964 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:42:27,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:42:27 BoogieIcfgContainer [2024-11-10 06:42:27,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:42:27,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:42:27,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:42:27,975 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:42:27,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:42:26" (3/4) ... [2024-11-10 06:42:27,979 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:42:27,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:42:27,982 INFO L158 Benchmark]: Toolchain (without parser) took 2190.43ms. Allocated memory is still 159.4MB. Free memory was 108.1MB in the beginning and 103.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,982 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 159.4MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:42:27,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.42ms. Allocated memory is still 159.4MB. Free memory was 108.1MB in the beginning and 94.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.08ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,984 INFO L158 Benchmark]: Boogie Preprocessor took 55.71ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,984 INFO L158 Benchmark]: IcfgBuilder took 547.24ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 72.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,987 INFO L158 Benchmark]: TraceAbstraction took 1159.61ms. Allocated memory is still 159.4MB. Free memory was 71.8MB in the beginning and 103.9MB in the end (delta: -32.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:42:27,988 INFO L158 Benchmark]: Witness Printer took 6.35ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 103.0MB in the end (delta: 882.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:42:27,990 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.36ms. Allocated memory is still 159.4MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.42ms. Allocated memory is still 159.4MB. Free memory was 108.1MB in the beginning and 94.0MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.08ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.71ms. Allocated memory is still 159.4MB. Free memory was 91.9MB in the beginning and 88.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 547.24ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 72.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1159.61ms. Allocated memory is still 159.4MB. Free memory was 71.8MB in the beginning and 103.9MB in the end (delta: -32.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.35ms. Allocated memory is still 159.4MB. Free memory was 103.9MB in the beginning and 103.0MB in the end (delta: 882.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_5 = 0; [L24] signed char var_1_6 = -8; [L25] signed char var_1_7 = 5; [L26] unsigned short int var_1_8 = 2; [L27] unsigned char var_1_11 = 0; [L28] double var_1_12 = 8.5; [L29] double var_1_13 = 999999999.6; [L30] signed long int var_1_14 = 10; [L31] signed char var_1_15 = -1; [L32] unsigned char var_1_16 = 16; [L33] unsigned char var_1_17 = 64; [L34] signed char last_1_var_1_1 = -16; VAL [isInitial=0, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=0, var_1_6=-8, var_1_7=5, var_1_8=2] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L69] var_1_5 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L72] var_1_6 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L73] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L74] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L74] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=5, var_1_8=2] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L76] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L77] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L80] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L80] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_13=4999999998/5, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L81] var_1_13 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L82] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L83] var_1_15 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L84] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L85] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L85] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L86] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L86] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L87] var_1_17 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L88] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L89] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L89] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L103] RET updateVariables() [L104] CALL step() [L38] COND TRUE var_1_5 && (last_1_var_1_1 <= last_1_var_1_1) [L39] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=17/2, var_1_14=10, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L41] var_1_12 = (var_1_13 - 8.3) [L42] unsigned char stepLocal_1 = var_1_13 >= var_1_12; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_1=1, var_1_11=1, var_1_14=10, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L43] COND TRUE var_1_5 && stepLocal_1 [L44] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L48] COND TRUE \read(var_1_5) [L49] var_1_8 = (var_1_16 + var_1_16) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L57] unsigned long int stepLocal_0 = (var_1_8 & 0u) * var_1_16; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_0=0, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=-16, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L58] COND FALSE !(stepLocal_0 > var_1_8) [L65] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((((var_1_8 & 0u) * var_1_16) > var_1_8) ? (var_1_5 ? (var_1_1 == ((signed char) ((16 + var_1_6) + var_1_7))) : (var_1_1 == ((signed char) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_6))) && (var_1_5 ? (var_1_8 == ((unsigned short int) (var_1_16 + var_1_16))) : (((var_1_16 > var_1_14) || var_1_11) ? (var_1_8 == ((unsigned short int) var_1_16)) : (var_1_8 == ((unsigned short int) var_1_16))))) && (var_1_12 == ((double) (var_1_13 - 8.3)))) && ((var_1_5 && (var_1_13 >= var_1_12)) ? (var_1_14 == ((signed long int) var_1_16)) : (var_1_14 == ((signed long int) var_1_15)))) && ((var_1_5 && (last_1_var_1_1 <= last_1_var_1_1)) ? (var_1_16 == ((unsigned char) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=31, var_1_5=1, var_1_6=31, var_1_7=63, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 65 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-10 06:42:28,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_has-floats_file-41.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 521a7b23bb41076c0af28c4cc3c2330626cca2c8b416fc98ef78b6e64d1f37d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:42:30,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:42:30,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:42:30,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:42:30,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:42:30,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:42:30,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:42:30,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:42:30,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:42:30,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:42:30,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:42:30,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:42:30,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:42:30,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:42:30,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:42:30,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:42:30,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:42:30,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:42:30,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:42:30,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:42:30,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:42:30,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:42:30,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:42:30,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:42:30,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:42:30,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:42:30,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:42:30,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:42:30,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:42:30,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:42:30,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:42:30,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:42:30,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:42:30,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:42:30,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:42:30,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:42:30,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:42:30,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:42:30,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:42:30,540 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:42:30,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:42:30,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:42:30,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:42:30,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:42:30,541 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 -> 521a7b23bb41076c0af28c4cc3c2330626cca2c8b416fc98ef78b6e64d1f37d0 [2024-11-10 06:42:30,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:42:30,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:42:30,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:42:30,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:42:30,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:42:30,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:32,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:42:32,828 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:42:32,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:32,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29be06904/6dd20c44a0c1429ab9bbe29e04139e3a/FLAGdbef1392b [2024-11-10 06:42:32,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29be06904/6dd20c44a0c1429ab9bbe29e04139e3a [2024-11-10 06:42:32,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:42:32,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:42:32,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:42:32,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:42:32,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:42:32,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:42:32" (1/1) ... [2024-11-10 06:42:32,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c8528a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:32, skipping insertion in model container [2024-11-10 06:42:32,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:42:32" (1/1) ... [2024-11-10 06:42:32,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:42:33,071 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_has-floats_file-41.i[917,930] [2024-11-10 06:42:33,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:42:33,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:42:33,155 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_has-floats_file-41.i[917,930] [2024-11-10 06:42:33,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:42:33,193 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:42:33,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33 WrapperNode [2024-11-10 06:42:33,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:42:33,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:42:33,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:42:33,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:42:33,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,252 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-10 06:42:33,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:42:33,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:42:33,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:42:33,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:42:33,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,292 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-10 06:42:33,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:42:33,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:42:33,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:42:33,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:42:33,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (1/1) ... [2024-11-10 06:42:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:42:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:42:33,359 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-10 06:42:33,363 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-10 06:42:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:42:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:42:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:42:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:42:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:42:33,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:42:33,502 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:42:33,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:42:34,092 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:42:34,093 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:42:34,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:42:34,107 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:42:34,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:42:34 BoogieIcfgContainer [2024-11-10 06:42:34,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:42:34,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:42:34,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:42:34,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:42:34,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:42:32" (1/3) ... [2024-11-10 06:42:34,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253eb54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:42:34, skipping insertion in model container [2024-11-10 06:42:34,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:42:33" (2/3) ... [2024-11-10 06:42:34,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253eb54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:42:34, skipping insertion in model container [2024-11-10 06:42:34,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:42:34" (3/3) ... [2024-11-10 06:42:34,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-41.i [2024-11-10 06:42:34,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:42:34,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:42:34,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:42:34,206 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;@1b2be2d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:42:34,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:42:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:42:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:42:34,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:42:34,241 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:42:34,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:42:34,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:42:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1648002553, now seen corresponding path program 1 times [2024-11-10 06:42:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:42:34,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597920888] [2024-11-10 06:42:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:42:34,266 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-10 06:42:34,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:42:34,270 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-10 06:42:34,271 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-10 06:42:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:34,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:42:34,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:42:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-10 06:42:34,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:42:34,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:42:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597920888] [2024-11-10 06:42:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597920888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:42:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:42:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:42:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29998859] [2024-11-10 06:42:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:42:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:42:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:42:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:42:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:42:34,567 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:42:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:42:34,594 INFO L93 Difference]: Finished difference Result 94 states and 153 transitions. [2024-11-10 06:42:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:42:34,597 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:42:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:42:34,605 INFO L225 Difference]: With dead ends: 94 [2024-11-10 06:42:34,605 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 06:42:34,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:42:34,616 INFO L432 NwaCegarLoop]: 65 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, 65 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-10 06:42:34,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:42:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 06:42:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 06:42:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 06:42:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-10 06:42:34,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 94 [2024-11-10 06:42:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:42:34,669 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-10 06:42:34,669 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:42:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-10 06:42:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:42:34,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:42:34,674 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:42:34,684 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-10 06:42:34,875 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-10 06:42:34,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:42:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:42:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1517194117, now seen corresponding path program 1 times [2024-11-10 06:42:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:42:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742951273] [2024-11-10 06:42:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:42:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:42:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:42:34,883 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-10 06:42:34,884 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-10 06:42:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:42:35,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 06:42:35,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:43:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 06:43:39,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:43:39,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:43:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742951273] [2024-11-10 06:43:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742951273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:43:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:43:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 06:43:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44940835] [2024-11-10 06:43:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:43:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 06:43:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:43:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 06:43:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:43:39,621 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:43:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:43:55,544 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2024-11-10 06:43:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:43:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-10 06:43:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:43:55,547 INFO L225 Difference]: With dead ends: 149 [2024-11-10 06:43:55,548 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 06:43:55,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:43:55,549 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 93 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:43:55,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 446 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-10 06:43:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 06:43:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-10 06:43:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:43:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-11-10 06:43:55,571 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 94 [2024-11-10 06:43:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:43:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-11-10 06:43:55,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 06:43:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-11-10 06:43:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 06:43:55,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:43:55,575 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:43:55,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:43:55,775 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-10 06:43:55,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:43:55,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:43:55,778 INFO L85 PathProgramCache]: Analyzing trace with hash -290260346, now seen corresponding path program 1 times [2024-11-10 06:43:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:43:55,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708842506] [2024-11-10 06:43:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:43:55,779 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-10 06:43:55,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:43:55,783 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-10 06:43:55,784 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-10 06:43:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:43:55,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 06:43:55,933 INFO L278 TraceCheckSpWp]: Computing forward predicates...