./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya --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.2.4-dev-0e0057c [2023-11-28 20:21:12,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:21:12,508 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:21:12,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:21:12,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:21:12,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:21:12,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:21:12,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:21:12,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:21:12,539 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:21:12,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:21:12,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:21:12,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:21:12,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:21:12,542 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:21:12,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:21:12,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:21:12,543 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:21:12,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:21:12,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:21:12,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:21:12,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:21:12,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:21:12,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:21:12,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:21:12,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:21:12,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:21:12,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:21:12,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:21:12,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:21:12,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:21:12,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:12,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:21:12,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:21:12,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:21:12,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:21:12,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:21:12,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:21:12,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:21:12,551 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:21:12,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:21:12,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:21:12,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-28 20:21:12,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:21:12,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:21:12,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:21:12,798 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:21:12,799 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:21:12,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/loop-1.c [2023-11-28 20:21:15,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:15,716 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:15,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c [2023-11-28 20:21:15,724 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/dfc819496/fc80411dea9c47d093128ebfe2af1b8f/FLAG34478ca2f [2023-11-28 20:21:15,738 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/dfc819496/fc80411dea9c47d093128ebfe2af1b8f [2023-11-28 20:21:15,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:15,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:15,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:15,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:15,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:15,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:15,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cc9949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15, skipping insertion in model container [2023-11-28 20:21:15,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:15,768 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:15,912 WARN L240 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_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2023-11-28 20:21:15,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:15,934 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:15,946 WARN L240 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_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2023-11-28 20:21:15,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:15,961 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:15,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15 WrapperNode [2023-11-28 20:21:15,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:15,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:15,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:15,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:15,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:15,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:15,988 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-11-28 20:21:15,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:15,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:15,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:15,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:16,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,012 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]. [2023-11-28 20:21:16,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:16,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:16,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:16,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:16,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (1/1) ... [2023-11-28 20:21:16,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:16,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:16,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:16,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:16,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:21:16,145 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:16,146 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:16,233 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:16,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:16,257 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:21:16,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:16 BoogieIcfgContainer [2023-11-28 20:21:16,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:16,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:16,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:16,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:16,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:15" (1/3) ... [2023-11-28 20:21:16,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b05323c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:16, skipping insertion in model container [2023-11-28 20:21:16,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:15" (2/3) ... [2023-11-28 20:21:16,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b05323c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:16, skipping insertion in model container [2023-11-28 20:21:16,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:16" (3/3) ... [2023-11-28 20:21:16,266 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2023-11-28 20:21:16,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:16,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:21:16,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:16,326 INFO L357 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, mHoare=true, 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;@6ca5ff11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:16,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:21:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-11-28 20:21:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:21:16,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:16,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:21:16,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:16,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 57541414, now seen corresponding path program 1 times [2023-11-28 20:21:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239349399] [2023-11-28 20:21:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:21:16,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:21:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:21:16,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:21:16,454 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:21:16,455 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:21:16,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:21:16,460 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-28 20:21:16,464 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:21:16,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:21:16 BoogieIcfgContainer [2023-11-28 20:21:16,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:21:16,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:21:16,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:21:16,480 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:21:16,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:16" (3/4) ... [2023-11-28 20:21:16,483 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:21:16,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:21:16,485 INFO L158 Benchmark]: Toolchain (without parser) took 743.91ms. Allocated memory is still 146.8MB. Free memory was 108.8MB in the beginning and 72.2MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-28 20:21:16,486 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:21:16,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.43ms. Allocated memory is still 146.8MB. Free memory was 108.8MB in the beginning and 98.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:21:16,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.63ms. Allocated memory is still 146.8MB. Free memory was 98.3MB in the beginning and 96.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:21:16,488 INFO L158 Benchmark]: Boogie Preprocessor took 31.26ms. Allocated memory is still 146.8MB. Free memory was 96.8MB in the beginning and 95.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:21:16,489 INFO L158 Benchmark]: RCFGBuilder took 237.12ms. Allocated memory is still 146.8MB. Free memory was 95.3MB in the beginning and 85.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:21:16,490 INFO L158 Benchmark]: TraceAbstraction took 218.83ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 72.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:21:16,490 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 146.8MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:21:16,494 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.16ms. Allocated memory is still 146.8MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.43ms. Allocated memory is still 146.8MB. Free memory was 108.8MB in the beginning and 98.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.63ms. Allocated memory is still 146.8MB. Free memory was 98.3MB in the beginning and 96.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.26ms. Allocated memory is still 146.8MB. Free memory was 96.8MB in the beginning and 95.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.12ms. Allocated memory is still 146.8MB. Free memory was 95.3MB in the beginning and 85.8MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 218.83ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 72.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 146.8MB. Free memory is still 72.2MB. 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 someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 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=8occurred 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, 5 NumberOfCodeBlocks, 5 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 [2023-11-28 20:21:16,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya --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.2.4-dev-0e0057c [2023-11-28 20:21:18,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:21:18,533 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:21:18,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:21:18,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:21:18,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:21:18,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:21:18,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:21:18,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:21:18,569 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:21:18,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:21:18,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:21:18,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:21:18,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:21:18,571 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:21:18,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:21:18,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:21:18,573 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:21:18,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:21:18,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:21:18,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:21:18,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:21:18,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:21:18,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:21:18,576 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:21:18,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:21:18,577 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:21:18,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:21:18,578 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:21:18,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:21:18,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:21:18,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:21:18,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:21:18,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:18,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:21:18,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:21:18,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:21:18,581 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:21:18,581 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:21:18,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:21:18,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:21:18,582 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:21:18,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:21:18,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:21:18,582 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:21:18,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-28 20:21:18,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:21:18,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:21:18,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:21:18,901 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:21:18,902 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:21:18,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/loop-1.c [2023-11-28 20:21:21,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:21,894 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:21,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c [2023-11-28 20:21:21,901 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/f70af27a3/37cebd095ec140f2a6c736dcb41f3965/FLAG54bd08065 [2023-11-28 20:21:21,917 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/data/f70af27a3/37cebd095ec140f2a6c736dcb41f3965 [2023-11-28 20:21:21,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:21,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:21,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:21,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:21,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:21,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:21" (1/1) ... [2023-11-28 20:21:21,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f56ab56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:21, skipping insertion in model container [2023-11-28 20:21:21,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:21" (1/1) ... [2023-11-28 20:21:21,949 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:22,118 WARN L240 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_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2023-11-28 20:21:22,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:22,146 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:22,158 WARN L240 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_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2023-11-28 20:21:22,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:22,178 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:22,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22 WrapperNode [2023-11-28 20:21:22,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:22,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:22,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:22,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:22,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,214 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2023-11-28 20:21:22,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:22,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:22,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:22,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:22,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,241 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]. [2023-11-28 20:21:22,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:22,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:22,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:22,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:22,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (1/1) ... [2023-11-28 20:21:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:22,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:22,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:22,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:21:22,415 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:22,417 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:22,948 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:22,981 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:22,981 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:21:22,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:22 BoogieIcfgContainer [2023-11-28 20:21:22,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:22,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:22,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:22,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:22,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:21" (1/3) ... [2023-11-28 20:21:22,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbcec30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:22, skipping insertion in model container [2023-11-28 20:21:22,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:22" (2/3) ... [2023-11-28 20:21:22,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbcec30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:22, skipping insertion in model container [2023-11-28 20:21:22,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:22" (3/3) ... [2023-11-28 20:21:22,990 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-1.c [2023-11-28 20:21:23,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:23,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:21:23,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:23,057 INFO L357 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, mHoare=true, 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;@ca9bd78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:23,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:21:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-11-28 20:21:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:21:23,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:23,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:21:23,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:23,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 57541414, now seen corresponding path program 1 times [2023-11-28 20:21:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557642134] [2023-11-28 20:21:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:23,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:21:23,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:23,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:21:23,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:21:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:23,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:21:23,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:23,245 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:21:23,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:21:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557642134] [2023-11-28 20:21:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557642134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:23,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91113458] [2023-11-28 20:21:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:21:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:23,278 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-28 20:21:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:23,471 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-28 20:21:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:23,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-28 20:21:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:23,479 INFO L225 Difference]: With dead ends: 15 [2023-11-28 20:21:23,479 INFO L226 Difference]: Without dead ends: 7 [2023-11-28 20:21:23,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:23,484 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:23,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:21:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-11-28 20:21:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-11-28 20:21:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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) [2023-11-28 20:21:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-11-28 20:21:23,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2023-11-28 20:21:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:23,507 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-11-28 20:21:23,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-28 20:21:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-11-28 20:21:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 20:21:23,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:23,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 20:21:23,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:21:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:21:23,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:23,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1785449205, now seen corresponding path program 1 times [2023-11-28 20:21:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811124854] [2023-11-28 20:21:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:23,711 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 [2023-11-28 20:21:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:23,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:21:23,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:21:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:23,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:21:23,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:23,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:29,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:21:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811124854] [2023-11-28 20:21:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811124854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:29,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:21:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-11-28 20:21:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480321098] [2023-11-28 20:21:29,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:29,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:21:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:21:29,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:21:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:21:29,442 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-28 20:21:31,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:21:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:31,853 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2023-11-28 20:21:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:21:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 [2023-11-28 20:21:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:31,858 INFO L225 Difference]: With dead ends: 14 [2023-11-28 20:21:31,858 INFO L226 Difference]: Without dead ends: 10 [2023-11-28 20:21:31,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:21:31,860 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:31,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-28 20:21:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-28 20:21:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-28 20:21:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2023-11-28 20:21:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-28 20:21:31,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2023-11-28 20:21:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:31,865 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-28 20:21:31,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-28 20:21:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-28 20:21:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 20:21:31,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:31,866 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2023-11-28 20:21:31,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:21:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:21:32,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:32,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1198981402, now seen corresponding path program 2 times [2023-11-28 20:21:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:21:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127683925] [2023-11-28 20:21:32,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:21:32,068 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 [2023-11-28 20:21:32,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:21:32,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:21:32,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:21:32,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:21:32,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:21:32,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 20:21:32,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:34,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:22:45,872 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:52,961 WARN L293 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:23:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:52,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127683925] [2023-11-28 20:23:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127683925] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:52,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:23:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-28 20:23:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529416761] [2023-11-28 20:23:52,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:23:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:23:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=71, Unknown=14, NotChecked=0, Total=132 [2023-11-28 20:23:52,963 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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) [2023-11-28 20:23:55,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:01,467 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse1 .cse3))) (and (fp.lt .cse0 .cse1) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (fp.lt .cse2 .cse4) (fp.lt .cse5 .cse6)))))) is different from true [2023-11-28 20:24:53,576 WARN L293 SmtUtils]: Spent 16.57s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:24:57,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:01,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:39,272 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:25:42,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:46,463 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 [] [2023-11-28 20:25:50,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:54,366 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 [] [2023-11-28 20:25:55,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:59,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:01,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:05,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:10,029 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 [] [2023-11-28 20:26:11,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:15,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:16,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:26:16,857 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2023-11-28 20:26:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:26:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 9 [2023-11-28 20:26:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:26:16,878 INFO L225 Difference]: With dead ends: 20 [2023-11-28 20:26:16,878 INFO L226 Difference]: Without dead ends: 16 [2023-11-28 20:26:16,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 226.0s TimeCoverageRelationStatistics Valid=71, Invalid=92, Unknown=23, NotChecked=24, Total=210 [2023-11-28 20:26:16,881 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 47.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:26:16,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 7 Unknown, 7 Unchecked, 47.9s Time] [2023-11-28 20:26:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-28 20:26:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-28 20:26:16,886 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) [2023-11-28 20:26:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-11-28 20:26:16,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2023-11-28 20:26:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:26:16,887 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-11-28 20:26:16,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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) [2023-11-28 20:26:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-11-28 20:26:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:26:16,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:26:16,887 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2023-11-28 20:26:16,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:26:17,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:26:17,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:26:17,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:26:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash 533804166, now seen corresponding path program 3 times [2023-11-28 20:26:17,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:26:17,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638074196] [2023-11-28 20:26:17,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:26:17,090 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 [2023-11-28 20:26:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:26:17,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:26:17,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:26:18,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-28 20:26:18,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:26:18,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-28 20:26:18,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:27:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:27:36,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:27:48,485 WARN L293 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:14,427 WARN L293 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:28:19,784 WARN L293 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:29,588 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:37,676 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:44,817 WARN L876 $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 [2023-11-28 20:28:52,944 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:01,051 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:13,916 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:22,026 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:27,855 WARN L876 $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 [2023-11-28 20:29:35,992 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:44,139 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:51,900 WARN L293 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:00,036 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:08,174 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:12,214 WARN L854 $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 [2023-11-28 20:30:16,256 WARN L876 $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 [2023-11-28 20:30:24,430 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:32,594 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:40,764 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:48,935 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:30:57,109 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:01,160 WARN L854 $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 [2023-11-28 20:31:05,208 WARN L876 $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 [2023-11-28 20:31:13,485 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:21,668 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:29,852 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:38,028 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:46,203 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:50,254 WARN L854 $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 [2023-11-28 20:31:54,303 WARN L876 $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 [2023-11-28 20:32:02,561 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:10,766 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:18,984 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:27,192 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:35,393 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:39,447 WARN L854 $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 [2023-11-28 20:32:43,501 WARN L876 $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 [2023-11-28 20:32:51,734 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:59,959 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:08,184 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:16,421 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:24,654 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:28,718 WARN L854 $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 [2023-11-28 20:33:32,784 WARN L876 $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 [2023-11-28 20:33:41,209 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:49,469 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:57,732 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:05,989 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:14,255 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:34:18,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ 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 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse2 (fp.add c_currentRoundingMode (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| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse7 .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 [2023-11-28 20:34:22,388 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ 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 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse2 (fp.add c_currentRoundingMode (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| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse7 .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 [2023-11-28 20:34:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 52 not checked. [2023-11-28 20:34:22,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:34:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638074196] [2023-11-28 20:34:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638074196] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:22,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:34:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-11-28 20:34:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131817172] [2023-11-28 20:34:22,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:22,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-28 20:34:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:34:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-28 20:34:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=172, Unknown=22, NotChecked=280, Total=552 [2023-11-28 20:34:22,393 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) 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) [2023-11-28 20:34:26,502 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ 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 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse2 (fp.add c_currentRoundingMode (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| .cse4) .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse7 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse8 (fp.sub c_currentRoundingMode .cse3 .cse4))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4)) (.cse5 (fp.add c_currentRoundingMode .cse7 .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))))))) (= |c_ULTIMATE.start_main_~x~0#1| .cse4) (= |c_ULTIMATE.start_main_~y~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:30,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= |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)) .cse0)) (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 [2023-11-28 20:34:34,631 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= |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)) .cse0)) (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 [2023-11-28 20:34:38,696 WARN L876 $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))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) |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)) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:44,191 WARN L876 $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|) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse1 .cse0) (fp.sub c_currentRoundingMode .cse2 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= (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|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:48,242 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (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))))))) (= (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 [2023-11-28 20:34:54,425 WARN L876 $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 ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0)) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .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)) (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 [2023-11-28 20:35:42,178 WARN L293 SmtUtils]: Spent 10.45s on a formula simplification. DAG size of input: 17 DAG size of output: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:35:45,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:35:57,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:36:27,282 WARN L293 SmtUtils]: Spent 14.79s on a formula simplification. DAG size of input: 17 DAG size of output: 16 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:36:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:28,957 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-11-28 20:36:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-28 20:36:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) 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 [2023-11-28 20:36:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:28,982 INFO L225 Difference]: With dead ends: 24 [2023-11-28 20:36:28,982 INFO L226 Difference]: Without dead ends: 20 [2023-11-28 20:36:28,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 284.4s TimeCoverageRelationStatistics Valid=138, Invalid=231, Unknown=29, NotChecked=658, Total=1056 [2023-11-28 20:36:28,983 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:28,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 233 Unchecked, 9.6s Time] [2023-11-28 20:36:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-28 20:36:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-28 20:36:28,988 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) [2023-11-28 20:36:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2023-11-28 20:36:28,988 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2023-11-28 20:36:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:28,988 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2023-11-28 20:36:28,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) 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) [2023-11-28 20:36:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2023-11-28 20:36:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-28 20:36:28,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:28,990 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2023-11-28 20:36:29,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:36:29,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:36:29,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:29,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1556840378, now seen corresponding path program 4 times [2023-11-28 20:36:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216566673] [2023-11-28 20:36:29,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:36:29,191 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 [2023-11-28 20:36:29,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:29,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 20:36:29,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_066bb1bb-6c8b-4f1b-bf23-28bd459d427b/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 20:36:32,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:36:32,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:32,578 WARN L260 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-28 20:36:32,580 INFO L285 TraceCheckSpWp]: Computing forward predicates...