./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cos_polynomial.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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:33,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:33,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 19:50:33,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:33,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:33,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:33,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:33,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:33,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:33,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:33,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:33,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:33,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:33,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:33,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:33,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:33,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:33,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:33,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:33,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:33,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:33,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:33,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:33,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:33,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:33,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:33,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:33,695 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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2024-11-27 19:50:34,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:34,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:34,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:34,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:34,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:34,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2024-11-27 19:50:37,018 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/b5e83d646/0bd218945b7a457098bd9813edd6bc63/FLAGea602ea41 [2024-11-27 19:50:37,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:37,257 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c [2024-11-27 19:50:37,269 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/b5e83d646/0bd218945b7a457098bd9813edd6bc63/FLAGea602ea41 [2024-11-27 19:50:37,288 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/b5e83d646/0bd218945b7a457098bd9813edd6bc63 [2024-11-27 19:50:37,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:37,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:37,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:37,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:37,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:37,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62eba99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37, skipping insertion in model container [2024-11-27 19:50:37,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:37,472 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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2024-11-27 19:50:37,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:37,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:37,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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2024-11-27 19:50:37,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:37,547 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:37,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37 WrapperNode [2024-11-27 19:50:37,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:37,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:37,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:37,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:37,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,592 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 59 [2024-11-27 19:50:37,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:37,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:37,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:37,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:37,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,622 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 19:50:37,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:37,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:37,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:37,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:37,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (1/1) ... [2024-11-27 19:50:37,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:37,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:37,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:37,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:50:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:37,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:37,809 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:37,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:37,979 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:37,979 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:37,991 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:37,992 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 19:50:37,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:37 BoogieIcfgContainer [2024-11-27 19:50:37,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:37,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:37,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:38,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:38,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:37" (1/3) ... [2024-11-27 19:50:38,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134d9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:38, skipping insertion in model container [2024-11-27 19:50:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:37" (2/3) ... [2024-11-27 19:50:38,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5134d9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:38, skipping insertion in model container [2024-11-27 19:50:38,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:37" (3/3) ... [2024-11-27 19:50:38,010 INFO L128 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2024-11-27 19:50:38,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:38,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cos_polynomial.c that has 1 procedures, 17 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 19:50:38,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:38,121 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;@2d312358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:38,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:50:38,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:38,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:38,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1236255304, now seen corresponding path program 1 times [2024-11-27 19:50:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435276090] [2024-11-27 19:50:38,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:38,308 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 19:50:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435276090] [2024-11-27 19:50:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435276090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568889487] [2024-11-27 19:50:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:38,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:50:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:38,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:50:38,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:50:38,345 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:38,358 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-27 19:50:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:50:38,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-27 19:50:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:38,371 INFO L225 Difference]: With dead ends: 31 [2024-11-27 19:50:38,372 INFO L226 Difference]: Without dead ends: 13 [2024-11-27 19:50:38,377 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 19:50:38,380 INFO L435 NwaCegarLoop]: 19 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, 19 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 19:50:38,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-27 19:50:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-27 19:50:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-27 19:50:38,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-27 19:50:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:38,418 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-27 19:50:38,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-27 19:50:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:50:38,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:38,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:38,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:38,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2045601930, now seen corresponding path program 1 times [2024-11-27 19:50:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064674623] [2024-11-27 19:50:38,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:50:38,467 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:50:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:50:38,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 19:50:38,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:50:38,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 19:50:38,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:38,533 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-27 19:50:38,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:50:38,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:50:38 BoogieIcfgContainer [2024-11-27 19:50:38,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:50:38,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:50:38,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:50:38,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:50:38,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:37" (3/4) ... [2024-11-27 19:50:38,572 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 19:50:38,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:50:38,575 INFO L158 Benchmark]: Toolchain (without parser) took 1282.88ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 72.6MB in the end (delta: 45.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-27 19:50:38,576 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:38,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.64ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:38,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:38,580 INFO L158 Benchmark]: Boogie Preprocessor took 52.07ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:38,581 INFO L158 Benchmark]: RCFGBuilder took 346.32ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 93.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 19:50:38,581 INFO L158 Benchmark]: TraceAbstraction took 570.01ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 72.6MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:50:38,581 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 12.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:50:38,583 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.44ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.64ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 105.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.07ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 103.8MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 346.32ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 93.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 570.01ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 72.6MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 72.6MB in the end (delta: 12.6kB). 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: 14]: 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 someBinaryArithmeticDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticDOUBLEoperation at line 28, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someUnaryDOUBLEoperation at line 17, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 31. Possible FailurePath: [L16] double C1 = 4.16666666666666019037e-02; [L17] double C2 = -1.38888888888741095749e-03; [L18] double C3 = 2.48015872894767294178e-05; [L19] double C4 = -2.75573143513906633035e-07; [L20] double C5 = 2.08757232129817482790e-09; [L21] double C6 = -1.13596475577881948265e-11; VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L49] double a, r; [L51] a = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(a >= -0.5 && a <= 0.75) [L12] COND FALSE !(!cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L52] RET assume_abort_if_not(a >= -0.5 && a <= 0.75) [L54] CALL, EXPR mcos(a) [L25] double a, hz, z, r, qx, zr; [L26] z = x*x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L27] COND TRUE x < 0. [L27] x = -x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L28] hz = 0.5 * z [L29] r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*C6))))) [L30] zr = z*r VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L31] COND TRUE x < 0.3 [L32] return 1.-(hz-zr); VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L54] RET, EXPR mcos(a) [L54] r = mcos(a) [L56] CALL __VERIFIER_assert(r >= 0. && r <= 1.1) [L14] COND TRUE !(cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L14] reach_error() VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, 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, 19 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, 19 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 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 19:50:38,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:41,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:41,594 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-27 19:50:41,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:41,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:41,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:41,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:41,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:41,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:41,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:41,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:41,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:41,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:41,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:41,652 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:41,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 19:50:41,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:41,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:41,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:41,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:41,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:41,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:41,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:41,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:41,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:41,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:41,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:41,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:41,657 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 19:50:41,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 19:50:41,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:41,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:41,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:41,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:41,658 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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2024-11-27 19:50:42,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:42,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:42,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:42,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:42,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:42,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2024-11-27 19:50:45,161 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/cfedba5aa/d7a35906f8864ca69aee6a9b6af53e9e/FLAG239c7f169 [2024-11-27 19:50:45,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:45,446 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c [2024-11-27 19:50:45,457 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/cfedba5aa/d7a35906f8864ca69aee6a9b6af53e9e/FLAG239c7f169 [2024-11-27 19:50:45,484 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/data/cfedba5aa/d7a35906f8864ca69aee6a9b6af53e9e [2024-11-27 19:50:45,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:45,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:45,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:45,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:45,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:45,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3084bddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45, skipping insertion in model container [2024-11-27 19:50:45,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:45,701 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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2024-11-27 19:50:45,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:45,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:45,766 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_6c90cb72-1511-41dd-bdbb-e24d146ebfba/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2024-11-27 19:50:45,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:45,806 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:45,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45 WrapperNode [2024-11-27 19:50:45,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:45,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:45,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:45,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:45,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,860 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2024-11-27 19:50:45,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:45,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:45,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:45,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:45,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,891 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 19:50:45,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:45,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:45,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:45,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:45,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (1/1) ... [2024-11-27 19:50:45,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:45,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:45,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 19:50:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:45,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:46,058 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:46,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:56,637 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:56,637 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:56,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:56,647 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 19:50:56,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:56 BoogieIcfgContainer [2024-11-27 19:50:56,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:56,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:56,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:56,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:56,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:45" (1/3) ... [2024-11-27 19:50:56,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4651789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:56, skipping insertion in model container [2024-11-27 19:50:56,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:45" (2/3) ... [2024-11-27 19:50:56,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4651789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:56, skipping insertion in model container [2024-11-27 19:50:56,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:56" (3/3) ... [2024-11-27 19:50:56,660 INFO L128 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2024-11-27 19:50:56,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:56,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cos_polynomial.c that has 1 procedures, 17 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 19:50:56,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:56,761 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;@5da328e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:56,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:50:56,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:56,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:56,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1236255304, now seen corresponding path program 1 times [2024-11-27 19:50:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:56,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520403038] [2024-11-27 19:50:56,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:56,798 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 19:50:56,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:56,801 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:50:56,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:50:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:59,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 19:50:59,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:59,149 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 19:50:59,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:50:59,153 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:50:59,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520403038] [2024-11-27 19:50:59,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520403038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:59,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:59,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868630567] [2024-11-27 19:50:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:59,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 19:50:59,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:50:59,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 19:50:59,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 19:50:59,191 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:59,204 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-27 19:50:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 19:50:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-27 19:50:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:59,231 INFO L225 Difference]: With dead ends: 31 [2024-11-27 19:50:59,231 INFO L226 Difference]: Without dead ends: 13 [2024-11-27 19:50:59,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 19:50:59,240 INFO L435 NwaCegarLoop]: 19 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, 19 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 19:50:59,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-27 19:50:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-27 19:50:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-27 19:50:59,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2024-11-27 19:50:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:59,274 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-27 19:50:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-27 19:50:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:50:59,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:59,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:59,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:59,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:50:59,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:59,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2045601930, now seen corresponding path program 1 times [2024-11-27 19:50:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:50:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144689321] [2024-11-27 19:50:59,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:59,478 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 19:50:59,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:50:59,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:50:59,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:52:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:52:41,244 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 19:52:41,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:53:09,093 WARN L286 SmtUtils]: Spent 11.49s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 19:53:36,433 WARN L286 SmtUtils]: Spent 14.83s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 19:53:45,808 WARN L286 SmtUtils]: Spent 9.31s 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 19:53:54,876 WARN L286 SmtUtils]: Spent 9.07s 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 19:54:03,595 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:54:12,654 WARN L286 SmtUtils]: Spent 9.06s 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 19:54:21,804 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:54:26,168 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_mcos_~hz~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (= (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))) |c_ULTIMATE.start_mcos_~zr~0#1|) (fp.geq |v_ULTIMATE.start_mcos_~x#1_11| (fp.neg .cse0)) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= |c_ULTIMATE.start_mcos_~x#1| (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 19:54:35,736 WARN L286 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:54:45,053 WARN L286 SmtUtils]: Spent 9.32s 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 19:54:51,168 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:55:00,476 WARN L286 SmtUtils]: Spent 9.31s 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 19:55:04,836 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse0 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res#1|))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-27 19:55:22,449 WARN L286 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:55:31,862 WARN L286 SmtUtils]: Spent 9.41s 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 19:55:41,242 WARN L286 SmtUtils]: Spent 9.38s 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 19:55:54,394 WARN L286 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:56:03,744 WARN L286 SmtUtils]: Spent 9.35s 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 19:56:13,174 WARN L286 SmtUtils]: Spent 9.43s 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 19:56:26,743 WARN L286 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:56:35,842 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:56:44,895 WARN L286 SmtUtils]: Spent 9.05s 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 19:56:53,949 WARN L286 SmtUtils]: Spent 9.05s 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 19:56:58,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse7 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse9 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse11 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven .cse3 (let ((.cse5 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) (fp.mul roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse5 .cse11))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 .cse1) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse3 (let ((.cse12 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse12) (fp.mul roundNearestTiesToEven .cse12 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse12 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse12 .cse11))))))))))))))) .cse1)) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse3 (let ((.cse13 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse13) (fp.mul roundNearestTiesToEven .cse13 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse13 .cse11))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse2) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))))))) is different from false [2024-11-27 19:57:12,130 WARN L286 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:57:21,254 WARN L286 SmtUtils]: Spent 9.12s 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 19:57:30,413 WARN L286 SmtUtils]: Spent 9.16s 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 19:57:43,443 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 19:57:52,640 WARN L286 SmtUtils]: Spent 9.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 19:58:01,651 WARN L286 SmtUtils]: Spent 9.01s 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 19:58:06,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse2 .cse8))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse10 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse10 .cse8))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))))) is different from false [2024-11-27 19:58:10,566 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse6 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (or (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse2 .cse8))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))) (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 (let ((.cse10 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse10 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse10 .cse8))))))))))))))) (_ +zero 11 53))) (fp.lt (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|) .cse9) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)))))) is different from true [2024-11-27 19:58:10,567 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 19:58:10,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:58:10,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:58:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144689321] [2024-11-27 19:58:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144689321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:58:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:58:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:58:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690473352] [2024-11-27 19:58:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:58:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 19:58:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:58:10,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 19:58:10,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=29, Unknown=6, NotChecked=52, Total=110 [2024-11-27 19:58:10,569 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:58:14,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:58:17,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:19,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:58:23,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:58:25,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:58:29,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:35,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:39,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:43,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:47,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:51,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:58:55,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0)))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0))) (.cse7 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (.cse5 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0)))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)))) (and (exists ((|v_ULTIMATE.start_mcos_~x#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_mcos_~x#1_11| |v_ULTIMATE.start_mcos_~x#1_11|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_mcos_~hz~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (= (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode .cse1 .cse7)))))))))))) |c_ULTIMATE.start_mcos_~zr~0#1|) (fp.geq |v_ULTIMATE.start_mcos_~x#1_11| (fp.neg .cse0)) (fp.lt |v_ULTIMATE.start_mcos_~x#1_11| (_ +zero 11 53)) (= |c_ULTIMATE.start_mcos_~x#1| (fp.neg |v_ULTIMATE.start_mcos_~x#1_11|))))) (= c_~C2~0 .cse3) (= .cse6 c_~C5~0) (= c_~C6~0 .cse7) (= .cse5 c_~C4~0) (= .cse4 c_~C3~0) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 c_~C1~0))) is different from false [2024-11-27 19:59:00,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:04,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:59:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:12,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:16,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:19,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:22,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:59:24,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:29,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:59:33,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:36,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-27 19:59:38,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:59:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:59:39,415 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-27 19:59:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 19:59:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-27 19:59:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:59:39,417 INFO L225 Difference]: With dead ends: 25 [2024-11-27 19:59:39,418 INFO L226 Difference]: Without dead ends: 21 [2024-11-27 19:59:39,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=25, Invalid=30, Unknown=7, NotChecked=70, Total=132 [2024-11-27 19:59:39,419 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 84.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:59:39,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 14 Unknown, 115 Unchecked, 84.0s Time] [2024-11-27 19:59:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-27 19:59:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2024-11-27 19:59:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:59:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-27 19:59:39,423 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2024-11-27 19:59:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:59:39,423 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-27 19:59:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:59:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-27 19:59:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 19:59:39,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:59:39,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:59:39,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:59:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:59:39,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:59:39,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:59:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1988343628, now seen corresponding path program 1 times [2024-11-27 19:59:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:59:39,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250789560] [2024-11-27 19:59:39,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:59:39,626 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 19:59:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-27 19:59:39,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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 19:59:39,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c90cb72-1511-41dd-bdbb-e24d146ebfba/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)] Waiting until timeout for monitored process