./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:08:51,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:08:51,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:08:51,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:08:51,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:08:51,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:08:51,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:08:51,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:08:51,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:08:51,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:08:51,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:08:51,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:08:51,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:08:51,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:08:51,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:08:51,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:08:51,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:08:51,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:08:51,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:08:51,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:08:51,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:08:51,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:08:51,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:08:51,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:51,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:51,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:51,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:51,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:08:51,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:51,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:51,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:51,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:51,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:08:51,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:08:51,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:08:51,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:08:51,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:08:51,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:08:51,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:08:51,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:08:51,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:08:51,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:08:51,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2024-11-27 20:08:51,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:08:51,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:08:51,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:08:51,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:08:51,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:08:51,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-11-27 20:08:54,928 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/b9df7e9bf/267ede446f374fb99f5f3281fe9e7890/FLAG2a4c846a7 [2024-11-27 20:08:55,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:08:55,206 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-11-27 20:08:55,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/b9df7e9bf/267ede446f374fb99f5f3281fe9e7890/FLAG2a4c846a7 [2024-11-27 20:08:55,236 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/b9df7e9bf/267ede446f374fb99f5f3281fe9e7890 [2024-11-27 20:08:55,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:08:55,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:08:55,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:55,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:08:55,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:08:55,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76470e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55, skipping insertion in model container [2024-11-27 20:08:55,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:08:55,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-11-27 20:08:55,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:55,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:08:55,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-11-27 20:08:55,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:55,551 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:08:55,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55 WrapperNode [2024-11-27 20:08:55,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:55,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:55,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:08:55,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:08:55,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,600 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-11-27 20:08:55,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:55,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:08:55,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:08:55,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:08:55,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,636 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:08:55,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:08:55,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:08:55,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:08:55,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:08:55,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (1/1) ... [2024-11-27 20:08:55,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:55,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:55,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:08:55,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:08:55,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:08:55,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:08:55,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:08:55,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:08:55,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:08:55,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:08:55,833 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:08:55,835 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:08:55,983 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-27 20:08:55,985 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:08:55,999 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:08:56,000 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:08:56,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:56 BoogieIcfgContainer [2024-11-27 20:08:56,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:08:56,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:08:56,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:08:56,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:08:56,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:08:55" (1/3) ... [2024-11-27 20:08:56,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214fce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:56, skipping insertion in model container [2024-11-27 20:08:56,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:55" (2/3) ... [2024-11-27 20:08:56,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214fce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:56, skipping insertion in model container [2024-11-27 20:08:56,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:56" (3/3) ... [2024-11-27 20:08:56,018 INFO L128 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-11-27 20:08:56,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:08:56,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG freire1_valuebound50.c that has 2 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:08:56,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:08:56,152 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a3d4729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:08:56,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:08:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:08:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:08:56,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:56,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:56,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:56,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 120323230, now seen corresponding path program 1 times [2024-11-27 20:08:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40291028] [2024-11-27 20:08:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:08:56,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:56,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40291028] [2024-11-27 20:08:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40291028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:56,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278393661] [2024-11-27 20:08:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:08:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:56,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:08:56,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:08:56,390 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:56,409 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-11-27 20:08:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:08:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-27 20:08:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:56,420 INFO L225 Difference]: With dead ends: 31 [2024-11-27 20:08:56,420 INFO L226 Difference]: Without dead ends: 13 [2024-11-27 20:08:56,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:08:56,427 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:56,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:08:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-27 20:08:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-27 20:08:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:08:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-27 20:08:56,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2024-11-27 20:08:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:56,465 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-27 20:08:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:08:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-27 20:08:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:08:56,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:56,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:56,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:08:56,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:08:56,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash 177581532, now seen corresponding path program 1 times [2024-11-27 20:08:56,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:56,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035793606] [2024-11-27 20:08:56,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:56,490 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:56,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:08:56,522 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:08:56,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:08:56,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:08:56,530 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-27 20:08:56,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:08:56,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:08:56 BoogieIcfgContainer [2024-11-27 20:08:56,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:08:56,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:08:56,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:08:56,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:08:56,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:56" (3/4) ... [2024-11-27 20:08:56,564 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:08:56,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:08:56,566 INFO L158 Benchmark]: Toolchain (without parser) took 1325.79ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 49.6MB in the end (delta: 43.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 20:08:56,568 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:08:56,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.44ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:56,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.61ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:08:56,570 INFO L158 Benchmark]: Boogie Preprocessor took 61.08ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:56,571 INFO L158 Benchmark]: RCFGBuilder took 337.84ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 69.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:56,571 INFO L158 Benchmark]: TraceAbstraction took 553.62ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 49.8MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:08:56,572 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 117.4MB. Free memory was 49.8MB in the beginning and 49.6MB in the end (delta: 201.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:08:56,578 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.47ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.44ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.4MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.61ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.08ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 337.84ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 69.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 553.62ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 49.8MB in the end (delta: 19.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 117.4MB. Free memory was 49.8MB in the beginning and 49.6MB in the end (delta: 201.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=50) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=50) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L19] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:08:56,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:08:59,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:08:59,813 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 20:08:59,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:08:59,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:08:59,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:08:59,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:08:59,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:08:59,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:08:59,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:08:59,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:08:59,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:08:59,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:08:59,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:08:59,882 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:08:59,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:08:59,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:08:59,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:08:59,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:08:59,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:08:59,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:08:59,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:59,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:59,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:59,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:59,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:08:59,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:59,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:59,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:59,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:08:59,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:08:59,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:08:59,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2024-11-27 20:09:00,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:09:00,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:09:00,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:09:00,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:09:00,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:09:00,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-11-27 20:09:03,436 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae7accaf/4d51ad2dc19c438c9e2700fbfc4e4593/FLAG726c34082 [2024-11-27 20:09:03,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:09:03,746 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-11-27 20:09:03,754 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae7accaf/4d51ad2dc19c438c9e2700fbfc4e4593/FLAG726c34082 [2024-11-27 20:09:04,049 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/data/8ae7accaf/4d51ad2dc19c438c9e2700fbfc4e4593 [2024-11-27 20:09:04,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:09:04,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:09:04,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:04,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:09:04,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:09:04,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1107078e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04, skipping insertion in model container [2024-11-27 20:09:04,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:09:04,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-11-27 20:09:04,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:04,336 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:09:04,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-11-27 20:09:04,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:04,374 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:09:04,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04 WrapperNode [2024-11-27 20:09:04,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:04,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:04,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:09:04,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:09:04,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,414 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2024-11-27 20:09:04,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:04,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:09:04,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:09:04,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:09:04,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,440 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:09:04,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:09:04,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:09:04,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:09:04,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:09:04,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (1/1) ... [2024-11-27 20:09:04,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:04,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:09:04,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:09:04,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:09:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:09:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:09:04,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:09:04,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:09:04,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:09:04,651 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:09:04,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:09:06,003 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-27 20:09:06,006 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:09:06,018 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:09:06,018 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 20:09:06,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:06 BoogieIcfgContainer [2024-11-27 20:09:06,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:09:06,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:09:06,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:09:06,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:09:06,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:09:04" (1/3) ... [2024-11-27 20:09:06,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2d663d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:06, skipping insertion in model container [2024-11-27 20:09:06,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:04" (2/3) ... [2024-11-27 20:09:06,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2d663d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:06, skipping insertion in model container [2024-11-27 20:09:06,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:06" (3/3) ... [2024-11-27 20:09:06,032 INFO L128 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-11-27 20:09:06,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:09:06,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG freire1_valuebound50.c that has 2 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:09:06,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:09:06,133 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45e58a61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:09:06,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:09:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:09:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:09:06,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:06,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:06,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:06,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 120323230, now seen corresponding path program 1 times [2024-11-27 20:09:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641518553] [2024-11-27 20:09:06,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:09:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:09:06,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 20:09:06,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-27 20:09:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:06,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:09:06,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:06,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:09:06,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:09:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641518553] [2024-11-27 20:09:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641518553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:06,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:06,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:09:06,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135596069] [2024-11-27 20:09:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:09:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:09:06,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:09:06,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:09:06,673 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:06,690 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-11-27 20:09:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:09:06,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-27 20:09:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:06,698 INFO L225 Difference]: With dead ends: 31 [2024-11-27 20:09:06,699 INFO L226 Difference]: Without dead ends: 13 [2024-11-27 20:09:06,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:09:06,705 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:06,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-27 20:09:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-27 20:09:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:09:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-27 20:09:06,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2024-11-27 20:09:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:06,771 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-27 20:09:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-27 20:09:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:09:06,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:06,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:06,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-27 20:09:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:09:06,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 177581532, now seen corresponding path program 1 times [2024-11-27 20:09:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:09:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484070452] [2024-11-27 20:09:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:09:06,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:09:06,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 20:09:06,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-27 20:09:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:07,375 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:07,734 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-27 20:09:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [950245707] [2024-11-27 20:09:07,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:09:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:09:07,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:09:07,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-27 20:09:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:09:08,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:19,204 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:09:31,420 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:09:39,299 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:09:47,359 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:10:02,387 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:10:10,451 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:10:14,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32))))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) is different from false [2024-11-27 20:10:25,079 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:10:36,508 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:10:48,697 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:11:01,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32)))))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32)))) (= (_ bv1 32) c___VERIFIER_assert_~cond)))) is different from false [2024-11-27 20:11:13,863 WARN L286 SmtUtils]: Spent 7.85s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:11:22,006 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:11:30,071 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:11:34,108 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))))) is different from false [2024-11-27 20:11:38,130 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))))) is different from true [2024-11-27 20:11:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:38,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:38,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484070452] [2024-11-27 20:11:38,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 20:11:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [950245707] [2024-11-27 20:11:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [950245707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:38,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:11:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714189793] [2024-11-27 20:11:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:38,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:11:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:38,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:11:38,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=4, NotChecked=30, Total=72 [2024-11-27 20:11:38,135 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:43,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:11:47,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:11:51,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:11:55,563 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32))))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse3)))) (_ bv0 32)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 20:11:59,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:02,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:06,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:08,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:12,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:16,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:20,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:24,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:28,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:32,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:37,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:12:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:37,135 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-27 20:12:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:12:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-27 20:12:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:37,178 INFO L225 Difference]: With dead ends: 22 [2024-11-27 20:12:37,178 INFO L226 Difference]: Without dead ends: 20 [2024-11-27 20:12:37,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=21, Invalid=20, Unknown=5, NotChecked=44, Total=90 [2024-11-27 20:12:37,179 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 54.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:37,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 12 Unknown, 75 Unchecked, 54.8s Time] [2024-11-27 20:12:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-27 20:12:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-27 20:12:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:12:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-27 20:12:37,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2024-11-27 20:12:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-27 20:12:37,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-27 20:12:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 20:12:37,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:37,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:37,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-27 20:12:37,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-27 20:12:37,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:12:37,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1861352346, now seen corresponding path program 1 times [2024-11-27 20:12:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936084103] [2024-11-27 20:12:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:37,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:12:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:12:37,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 20:12:37,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-27 20:12:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:37,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:12:37,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:46,187 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:12:50,230 WARN L851 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2024-11-27 20:12:54,271 WARN L873 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2024-11-27 20:13:02,361 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:13:14,500 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:13:18,562 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-11-27 20:13:30,722 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:13:34,764 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false [2024-11-27 20:13:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-27 20:13:34,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:42,953 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:13:51,041 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:14:07,342 WARN L286 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-27 20:14:23,600 WARN L286 SmtUtils]: Spent 16.26s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-27 20:14:31,718 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:14:35,779 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from true [2024-11-27 20:14:43,895 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:14:52,048 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:14:56,114 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from true [2024-11-27 20:14:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-27 20:14:56,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936084103] [2024-11-27 20:14:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936084103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:14:56,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-27 20:14:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9223041] [2024-11-27 20:14:56,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:14:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:56,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:14:56,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2024-11-27 20:14:56,120 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:15:00,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:15:04,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:15:08,365 WARN L873 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) is different from true [2024-11-27 20:15:12,428 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) .cse0) .cse0)) is different from true [2024-11-27 20:15:16,478 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-11-27 20:15:20,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (not .cse0) (= (_ bv1 32) c___VERIFIER_assert_~cond))) is different from false [2024-11-27 20:15:24,578 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (not .cse0) (= (_ bv1 32) c___VERIFIER_assert_~cond))) is different from true [2024-11-27 20:15:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:24,580 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-27 20:15:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:15:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-11-27 20:15:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:24,583 INFO L225 Difference]: With dead ends: 22 [2024-11-27 20:15:24,583 INFO L226 Difference]: Without dead ends: 17 [2024-11-27 20:15:24,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2024-11-27 20:15:24,584 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:24,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 89 Unchecked, 8.2s Time] [2024-11-27 20:15:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-27 20:15:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-27 20:15:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:15:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-27 20:15:24,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2024-11-27 20:15:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-27 20:15:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:15:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-27 20:15:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 20:15:24,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:24,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:24,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-27 20:15:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:15:24,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:15:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1863139806, now seen corresponding path program 1 times [2024-11-27 20:15:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962293510] [2024-11-27 20:15:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:15:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:15:24,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 20:15:24,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-27 20:15:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:15:25,596 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:15:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:15:26,372 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-27 20:15:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1875409900] [2024-11-27 20:15:26,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:15:26,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:15:26,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-27 20:15:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:29,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 20:15:29,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:13,208 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:16:21,377 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:16:29,563 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:16:41,726 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:16:49,922 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:16:58,110 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:02,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4) (fp.gt .cse2 .cse3)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4) (fp.gt .cse6 .cse3))))))) is different from false [2024-11-27 20:17:14,425 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:20,337 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:28,509 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:40,683 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:48,855 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:17:57,020 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:18:01,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4) (fp.gt .cse2 .cse3))))) (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse6 .cse3))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4) (fp.gt .cse6 .cse3))))))) is different from false [2024-11-27 20:18:13,292 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:18:20,793 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:18:28,962 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:18:33,004 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse1 .cse2)))) is different from false [2024-11-27 20:18:37,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse1 .cse2)))) is different from true [2024-11-27 20:18:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-27 20:18:37,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:48,034 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:18:52,081 WARN L851 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2024-11-27 20:18:56,123 WARN L873 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2024-11-27 20:19:04,349 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:12,474 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:16,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from false [2024-11-27 20:19:20,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) is different from true [2024-11-27 20:19:28,816 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:36,936 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:45,074 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:53,252 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:19:57,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from false [2024-11-27 20:20:01,332 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from true [2024-11-27 20:20:09,450 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:20:17,619 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:20:25,792 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:20:29,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from false [2024-11-27 20:20:33,879 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from true [2024-11-27 20:20:42,062 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:20:50,169 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:20:58,347 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:21:02,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~a~0#1_12|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) is different from false [2024-11-27 20:21:06,597 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~a~0#1_12|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) is different from true [2024-11-27 20:21:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-27 20:21:06,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962293510] [2024-11-27 20:21:06,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 20:21:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1875409900] [2024-11-27 20:21:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1875409900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:21:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-11-27 20:21:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339219724] [2024-11-27 20:21:06,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 20:21:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 20:21:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=14, NotChecked=168, Total=272 [2024-11-27 20:21:06,600 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:21:10,661 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~a~0#1_12|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 20:21:14,703 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_12| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_12| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.gt .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~a~0#1_12|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-27 20:21:18,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse0 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse1 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse1) (and (or (not .cse0) (not .cse1)) .cse2))) (let ((.cse5 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~a~0#1|) .cse4)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse5 .cse3))))) (not (fp.gt .cse5 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-27 20:21:22,802 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse0 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse1 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse1) (and (or (not .cse0) (not .cse1)) .cse2))) (let ((.cse5 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~a~0#1|) .cse4)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse5 .cse3))))) (not (fp.gt .cse5 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-27 20:21:26,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-27 20:21:30,889 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-27 20:21:34,931 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 20:21:39,001 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-27 20:21:43,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.gt .cse0 .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-27 20:21:47,137 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= (_ bv1 32) |c_ULTIMATE.start_main_~r~0#1|) (fp.gt .cse0 .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-27 20:21:51,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (and (not .cse0) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse6))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5) (fp.gt .cse3 .cse4)))) .cse0) (and (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse6))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse7 .cse4))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5) (fp.gt .cse7 .cse4))))))))) is different from false [2024-11-27 20:21:55,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse6))) (and (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5) (fp.gt .cse3 .cse4))))) (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse6))) (and (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse7 .cse4))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse5) (fp.gt .cse7 .cse4))))))) (not .cse0))) is different from false [2024-11-27 20:21:59,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:03,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:07,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:11,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:15,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:19,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 20:22:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:19,857 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-27 20:22:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:22:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-27 20:22:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:19,858 INFO L225 Difference]: With dead ends: 23 [2024-11-27 20:22:19,858 INFO L226 Difference]: Without dead ends: 21 [2024-11-27 20:22:19,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 121.6s TimeCoverageRelationStatistics Valid=51, Invalid=55, Unknown=26, NotChecked=420, Total=552 [2024-11-27 20:22:19,859 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:19,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 227 Unchecked, 24.7s Time] [2024-11-27 20:22:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-27 20:22:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-27 20:22:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 20:22:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-27 20:22:19,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2024-11-27 20:22:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:19,875 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-27 20:22:19,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:22:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-27 20:22:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 20:22:19,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:19,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:19,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-27 20:22:20,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/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)] Forceful destruction successful, exit code 0 [2024-11-27 20:22:20,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:22:20,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:22:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -497922976, now seen corresponding path program 2 times [2024-11-27 20:22:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811336499] [2024-11-27 20:22:20,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:22:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-27 20:22:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 20:22:20,280 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-27 20:22:20,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/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 (8)] Waiting until timeout for monitored process [2024-11-27 20:22:21,406 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:22:21,406 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:22:21,406 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:22:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:22:22,481 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-27 20:22:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2017371613] [2024-11-27 20:22:22,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:22:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:22:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:22:22,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:22:22,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1db88307-27fd-4a3b-a636-0219c3b780d1/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-27 20:22:26,982 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:22:26,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:22:26,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:22:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:07,570 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:23:49,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv2 32) |c_ULTIMATE.start_main_~r~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-27 20:24:02,907 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:24:11,072 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:24:19,323 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)