./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:47:24,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:47:24,630 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:47:24,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:47:24,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:47:24,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:47:24,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:47:24,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:47:24,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:47:24,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:47:24,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:47:24,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:47:24,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:47:24,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:47:24,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:47:24,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:47:24,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:24,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:47:24,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:47:24,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2024-11-13 13:47:24,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:47:24,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:47:24,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:47:24,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:47:24,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:47:24,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/loop-1.c Unable to find full path for "g++" [2024-11-13 13:47:26,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:47:27,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:47:27,185 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c [2024-11-13 13:47:27,192 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/a7211ea55/31644c45f3784ca8be657e8a6f39816d/FLAG1da26a5f6 [2024-11-13 13:47:27,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/a7211ea55/31644c45f3784ca8be657e8a6f39816d [2024-11-13 13:47:27,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:47:27,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:47:27,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:27,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:47:27,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:47:27,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c69772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27, skipping insertion in model container [2024-11-13 13:47:27,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:47:27,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-13 13:47:27,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:27,432 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:47:27,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-13 13:47:27,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:27,459 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:47:27,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27 WrapperNode [2024-11-13 13:47:27,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:27,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:27,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:47:27,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:47:27,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,496 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-13 13:47:27,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:27,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:47:27,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:47:27,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:47:27,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,518 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-13 13:47:27,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:47:27,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:47:27,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:47:27,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:47:27,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (1/1) ... [2024-11-13 13:47:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:47:27,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:47:27,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:47:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:47:27,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:47:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:47:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:47:27,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:47:27,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:47:27,761 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 13:47:27,761 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:47:27,770 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:47:27,771 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:47:27,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:27 BoogieIcfgContainer [2024-11-13 13:47:27,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:47:27,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:47:27,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:47:27,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:47:27,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:47:27" (1/3) ... [2024-11-13 13:47:27,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456aa3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:27, skipping insertion in model container [2024-11-13 13:47:27,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:27" (2/3) ... [2024-11-13 13:47:27,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456aa3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:27, skipping insertion in model container [2024-11-13 13:47:27,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:27" (3/3) ... [2024-11-13 13:47:27,784 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2024-11-13 13:47:27,800 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:47:27,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-1.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:47:27,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:47:27,885 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;@4a745bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:47:27,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:47:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 13:47:27,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:47:27,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:47:27,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:47:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:47:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 13:47:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:47:27,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452634349] [2024-11-13 13:47:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:47:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:47:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:47:28,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:47:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:47:28,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:47:28,061 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:47:28,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:47:28,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:47:28,070 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 13:47:28,087 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:47:28,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:47:28 BoogieIcfgContainer [2024-11-13 13:47:28,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:47:28,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:47:28,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:47:28,095 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:47:28,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:27" (3/4) ... [2024-11-13 13:47:28,099 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:47:28,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:47:28,104 INFO L158 Benchmark]: Toolchain (without parser) took 890.81ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 58.8MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 13:47:28,104 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:47:28,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 82.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:47:28,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:47:28,105 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:47:28,105 INFO L158 Benchmark]: RCFGBuilder took 236.32ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 71.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:47:28,106 INFO L158 Benchmark]: TraceAbstraction took 320.43ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 58.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:47:28,106 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:47:28,112 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.30ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 82.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.17ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.32ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 71.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 320.43ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 58.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 20, overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f [L14] COND FALSE !(x < y) [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) [L4] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-13 13:47:28,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:47:30,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:47:30,945 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:47:30,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:47:30,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:47:30,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:47:30,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:47:30,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:47:30,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:47:30,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:47:30,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:47:30,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:47:30,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:47:30,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:47:30,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:47:30,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:47:30,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:47:30,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:47:30,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:47:30,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:47:30,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:47:30,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:47:30,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:47:30,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:47:30,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:47:30,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:47:30,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:47:30,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:30,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:47:30,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:47:30,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:47:30,999 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2024-11-13 13:47:31,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:47:31,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:47:31,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:47:31,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:47:31,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:47:31,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/float-benchs/loop-1.c Unable to find full path for "g++" [2024-11-13 13:47:33,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:47:33,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:47:33,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c [2024-11-13 13:47:33,535 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/f89e48a49/1b4cf06283204349bef3c6da782f7e83/FLAG3b7a2d44a [2024-11-13 13:47:33,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/data/f89e48a49/1b4cf06283204349bef3c6da782f7e83 [2024-11-13 13:47:33,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:47:33,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:47:33,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:33,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:47:33,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:47:33,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7577bcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33, skipping insertion in model container [2024-11-13 13:47:33,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:47:33,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-13 13:47:33,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:33,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:47:33,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2024-11-13 13:47:33,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:47:33,826 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:47:33,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33 WrapperNode [2024-11-13 13:47:33,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:47:33,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:33,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:47:33,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:47:33,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,869 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2024-11-13 13:47:33,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:47:33,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:47:33,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:47:33,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:47:33,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,900 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-13 13:47:33,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:47:33,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:47:33,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:47:33,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:47:33,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (1/1) ... [2024-11-13 13:47:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:47:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:47:33,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:47:33,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:47:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:47:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:47:33,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:47:33,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:47:34,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:47:34,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:47:34,647 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 13:47:34,647 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:47:34,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:47:34,656 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:47:34,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:34 BoogieIcfgContainer [2024-11-13 13:47:34,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:47:34,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:47:34,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:47:34,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:47:34,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:47:33" (1/3) ... [2024-11-13 13:47:34,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573d082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:34, skipping insertion in model container [2024-11-13 13:47:34,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:47:33" (2/3) ... [2024-11-13 13:47:34,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573d082f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:47:34, skipping insertion in model container [2024-11-13 13:47:34,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:47:34" (3/3) ... [2024-11-13 13:47:34,668 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2024-11-13 13:47:34,683 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:47:34,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-1.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:47:34,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:47:34,768 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;@72d89013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:47:34,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:47:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 13:47:34,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:47:34,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:47:34,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:47:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:47:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 13:47:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:47:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050908055] [2024-11-13 13:47:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:47:34,802 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-13 13:47:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:47:34,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:34,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:34,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:47:34,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:47:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:47:35,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:47:35,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:47:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050908055] [2024-11-13 13:47:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050908055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:47:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:47:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:47:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262900244] [2024-11-13 13:47:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:47:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:47:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:47:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:47:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:47:35,056 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:47:35,259 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-13 13:47:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:47:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 13:47:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:47:35,267 INFO L225 Difference]: With dead ends: 20 [2024-11-13 13:47:35,268 INFO L226 Difference]: Without dead ends: 8 [2024-11-13 13:47:35,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:47:35,274 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:47:35,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:47:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-13 13:47:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-13 13:47:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-13 13:47:35,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-13 13:47:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:47:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-13 13:47:35,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-13 13:47:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 13:47:35,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:47:35,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:47:35,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:47:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:35,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:47:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:47:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1809556175, now seen corresponding path program 1 times [2024-11-13 13:47:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:47:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228297935] [2024-11-13 13:47:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:47:35,535 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-13 13:47:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:47:35,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:35,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:47:35,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:47:35,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:47:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:47:35,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:47:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:47:40,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:47:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228297935] [2024-11-13 13:47:40,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228297935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:47:40,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:47:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-13 13:47:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454758067] [2024-11-13 13:47:40,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:47:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:47:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:47:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:47:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:47:40,843 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:43,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:47:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:47:46,887 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-13 13:47:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:47:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 13:47:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:47:46,891 INFO L225 Difference]: With dead ends: 15 [2024-11-13 13:47:46,891 INFO L226 Difference]: Without dead ends: 11 [2024-11-13 13:47:46,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:47:46,892 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:47:46,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 13:47:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-13 13:47:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-13 13:47:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-13 13:47:46,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-11-13 13:47:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:47:46,896 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-13 13:47:46,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:47:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-13 13:47:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 13:47:46,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:47:46,897 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2024-11-13 13:47:46,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:47:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:47,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:47:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:47:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -287777557, now seen corresponding path program 2 times [2024-11-13 13:47:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:47:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474844073] [2024-11-13 13:47:47,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:47:47,099 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-13 13:47:47,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:47:47,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:47,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:47:47,370 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:47:47,371 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:47:47,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:47:47,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:47:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:47:49,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:48:57,201 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:01,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 13:49:05,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 13:49:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-13 13:49:05,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:49:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474844073] [2024-11-13 13:49:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474844073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:49:05,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:49:05,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-13 13:49:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647186966] [2024-11-13 13:49:05,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:49:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 13:49:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:49:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:49:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=81, Unknown=7, NotChecked=20, Total=156 [2024-11-13 13:49:05,264 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:49:07,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:49:48,200 WARN L286 SmtUtils]: Spent 18.00s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:49:52,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:09,484 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:50:13,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:16,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:26,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:48,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:49,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:51,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:53,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:50:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:50:54,319 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-13 13:50:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:50:54,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 13:50:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:50:54,325 INFO L225 Difference]: With dead ends: 20 [2024-11-13 13:50:54,325 INFO L226 Difference]: Without dead ends: 16 [2024-11-13 13:50:54,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 143.2s TimeCoverageRelationStatistics Valid=104, Invalid=165, Unknown=7, NotChecked=30, Total=306 [2024-11-13 13:50:54,326 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:50:54,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 4 Unknown, 15 Unchecked, 33.7s Time] [2024-11-13 13:50:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-13 13:50:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-13 13:50:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:50:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-13 13:50:54,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2024-11-13 13:50:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:50:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-13 13:50:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:50:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-13 13:50:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 13:50:54,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:50:54,333 INFO L215 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2024-11-13 13:50:54,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:50:54,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:50:54,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:50:54,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:50:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1690226481, now seen corresponding path program 3 times [2024-11-13 13:50:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:50:54,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240102043] [2024-11-13 13:50:54,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:50:54,534 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-13 13:50:54,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:50:54,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:50:54,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:50:55,368 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-13 13:50:55,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:50:55,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 13:50:55,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:51:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:51:44,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:51:57,155 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:52:22,305 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:52:28,630 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:52:33,671 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:52:41,753 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:52:49,852 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:52:55,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) is different from true [2024-11-13 13:53:03,748 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:53:11,852 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:53:19,958 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:53:28,066 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:53:36,174 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:53:40,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from false [2024-11-13 13:53:44,236 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5)) (.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse2 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))))))) is different from true [2024-11-13 13:53:52,375 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:00,545 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:08,669 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:16,807 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:24,946 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:28,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2024-11-13 13:54:33,021 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2024-11-13 13:54:41,176 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:49,331 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:54:57,478 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:05,721 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:13,892 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:17,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6) .cse6)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6) .cse6))) (let ((.cse7 (fp.add c_currentRoundingMode .cse0 .cse6)) (.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse8 .cse6)) (.cse2 (fp.add c_currentRoundingMode .cse7 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse3 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2024-11-13 13:55:21,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6) .cse6)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6) .cse6))) (let ((.cse7 (fp.add c_currentRoundingMode .cse0 .cse6)) (.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse8 .cse6)) (.cse2 (fp.add c_currentRoundingMode .cse7 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse3 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2024-11-13 13:55:30,168 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:38,343 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:46,548 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:55:54,731 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:02,907 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:06,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2024-11-13 13:56:11,015 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2024-11-13 13:56:19,235 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:27,434 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:35,626 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:43,832 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:52,026 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:56:56,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5) .cse5) .cse5) .cse5)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5) .cse5) .cse5) .cse5))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse7 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse4 .cse6)))))))) is different from false [2024-11-13 13:57:00,131 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5) .cse5) .cse5) .cse5)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5) .cse5) .cse5) .cse5))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse7 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse4 .cse6)))))))) is different from true [2024-11-13 13:57:08,407 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:57:16,620 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:57:24,819 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:57:33,074 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:57:41,284 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:57:45,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5) .cse5) .cse5) .cse5) .cse5)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5) .cse5) .cse5) .cse5) .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2024-11-13 13:57:49,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5) .cse5) .cse5) .cse5) .cse5)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5) .cse5) .cse5) .cse5) .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse5))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2024-11-13 13:57:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 42 not checked. [2024-11-13 13:57:49,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:57:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240102043] [2024-11-13 13:57:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240102043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:49,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:57:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-11-13 13:57:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914933596] [2024-11-13 13:57:49,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:57:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:57:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:57:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=172, Unknown=14, NotChecked=238, Total=506 [2024-11-13 13:57:49,573 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:51,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:55,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:59,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:02,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:04,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:06,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:10,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:14,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse4 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-13 13:58:18,476 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| .cse0) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (let ((.cse4 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0) .cse0)) (.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse2 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse1 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:58:22,540 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5) .cse5) .cse5) .cse5)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5) .cse5) .cse5) .cse5))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse5))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5)) (.cse0 (fp.add c_currentRoundingMode .cse7 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse4 .cse6))))))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse5 .cse5)) (= |c_ULTIMATE.start_main_~y~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:58:26,597 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse3 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse5 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse4) .cse4) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse4) .cse4) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:58:32,797 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0))) (let ((.cse7 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse8 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse4 (fp.sub c_currentRoundingMode .cse8 .cse0)) (.cse3 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse4 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse7 .cse8))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:58:36,845 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse6)) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse6))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse6)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse6))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse1 .cse6)) (.cse7 (fp.add c_currentRoundingMode .cse0 .cse6))) (let ((.cse4 (fp.add c_currentRoundingMode .cse7 .cse6)) (.cse5 (fp.sub c_currentRoundingMode .cse8 .cse6))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse6) (fp.sub c_currentRoundingMode .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse6) .cse6) .cse6) .cse6) |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse6 .cse6) .cse6) .cse6) .cse6)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:58:42,837 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 13:59:28,370 WARN L286 SmtUtils]: Spent 13.62s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:59:32,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:59:43,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:59:53,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:59:55,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:59:58,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:59:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:59:58,548 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-13 13:59:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 13:59:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 13:59:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:59:58,562 INFO L225 Difference]: With dead ends: 24 [2024-11-13 13:59:58,562 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 13:59:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 223.4s TimeCoverageRelationStatistics Valid=148, Invalid=262, Unknown=22, NotChecked=624, Total=1056 [2024-11-13 13:59:58,563 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:59:58,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 21 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 3 Unknown, 214 Unchecked, 35.9s Time] [2024-11-13 13:59:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 13:59:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 13:59:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:59:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-13 13:59:58,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2024-11-13 13:59:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:59:58,571 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-13 13:59:58,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:59:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-13 13:59:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 13:59:58,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:59:58,572 INFO L215 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2024-11-13 13:59:58,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 13:59:58,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:59:58,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:59:58,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:59:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1303726129, now seen corresponding path program 4 times [2024-11-13 13:59:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:59:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054155022] [2024-11-13 13:59:58,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:59:58,773 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-13 13:59:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:59:58,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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-13 13:59:58,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d07e04e-d72c-4390-b007-03a5891a26de/bin/uautomizer-verify-qhAvR1uOyd/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 (6)] Waiting until timeout for monitored process [2024-11-13 14:00:02,106 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:00:02,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:00:02,151 WARN L253 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 14:00:02,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:03:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:02,688 INFO L311 TraceCheckSpWp]: Computing backward predicates...