./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_iterated.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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_iterated.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 1b2a34283d37096850c6fa7d7933fe07674b3fa81a7da8c770f866e152d89627 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:06:59,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:06:59,850 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:06:59,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:06:59,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:06:59,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:06:59,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:06:59,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:06:59,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:06:59,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:06:59,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:06:59,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:06:59,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:06:59,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:06:59,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:06:59,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:06:59,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:06:59,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:06:59,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:06:59,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:06:59,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:06:59,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:59,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:59,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:59,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:06:59,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:06:59,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:06:59,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:06:59,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:06:59,887 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 -> 1b2a34283d37096850c6fa7d7933fe07674b3fa81a7da8c770f866e152d89627 [2024-11-28 02:07:00,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:07:00,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:07:00,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:07:00,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:07:00,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:07:00,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2_iterated.c [2024-11-28 02:07:03,237 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/bd1585a9a/81989f8f73e6464f9ea8dcd9f8941aee/FLAGc60bf0d33 [2024-11-28 02:07:03,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:07:03,527 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c [2024-11-28 02:07:03,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/bd1585a9a/81989f8f73e6464f9ea8dcd9f8941aee/FLAGc60bf0d33 [2024-11-28 02:07:03,564 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/bd1585a9a/81989f8f73e6464f9ea8dcd9f8941aee [2024-11-28 02:07:03,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:07:03,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:07:03,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:03,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:07:03,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:07:03,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bd0573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03, skipping insertion in model container [2024-11-28 02:07:03,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:07:03,776 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c[447,460] [2024-11-28 02:07:03,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:03,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:07:03,851 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c[447,460] [2024-11-28 02:07:03,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:03,898 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:07:03,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03 WrapperNode [2024-11-28 02:07:03,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:03,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:03,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:07:03,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:07:03,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,938 INFO L138 Inliner]: procedures = 17, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2024-11-28 02:07:03,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:03,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:07:03,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:07:03,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:07:03,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,963 INFO L175 MemorySlicer]: Split 41 memory accesses to 5 slices as follows [2, 9, 10, 9, 11]. 27 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 2, 2, 2, 2]. The 16 writes are split as follows [0, 4, 4, 4, 4]. [2024-11-28 02:07:03,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:07:03,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:07:03,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:07:03,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:07:03,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (1/1) ... [2024-11-28 02:07:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:04,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:07:04,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:07:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:07:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:07:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 02:07:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 02:07:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 02:07:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-28 02:07:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-28 02:07:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-28 02:07:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-28 02:07:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-28 02:07:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-28 02:07:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-28 02:07:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-28 02:07:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-28 02:07:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-28 02:07:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-28 02:07:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:07:04,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:07:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-28 02:07:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-28 02:07:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-28 02:07:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-28 02:07:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-28 02:07:04,171 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:07:04,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:07:04,336 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:04,336 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:04,344 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:04,345 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:07:04,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:04 BoogieIcfgContainer [2024-11-28 02:07:04,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:04,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:04,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:04,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:04,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:07:03" (1/3) ... [2024-11-28 02:07:04,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2aaf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:04, skipping insertion in model container [2024-11-28 02:07:04,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:03" (2/3) ... [2024-11-28 02:07:04,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2aaf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:04, skipping insertion in model container [2024-11-28 02:07:04,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:04" (3/3) ... [2024-11-28 02:07:04,355 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_iterated.c [2024-11-28 02:07:04,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:04,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_iterated.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:07:04,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:04,448 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;@12e4c2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:04,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:07:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-28 02:07:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 02:07:04,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:04,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:04,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:04,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 304794067, now seen corresponding path program 1 times [2024-11-28 02:07:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168708888] [2024-11-28 02:07:04,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:07:04,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:07:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:07:04,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:07:04,664 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:07:04,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:07:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:07:04,674 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-28 02:07:04,704 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:07:04,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:07:04 BoogieIcfgContainer [2024-11-28 02:07:04,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:07:04,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:07:04,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:07:04,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:07:04,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:04" (3/4) ... [2024-11-28 02:07:04,716 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:07:04,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:07:04,718 INFO L158 Benchmark]: Toolchain (without parser) took 1146.75ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 49.1MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-28 02:07:04,719 INFO L158 Benchmark]: CDTParser took 1.43ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:04,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.85ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:07:04,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:07:04,721 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:04,722 INFO L158 Benchmark]: RCFGBuilder took 362.33ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 64.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:07:04,722 INFO L158 Benchmark]: TraceAbstraction took 365.18ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 49.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:07:04,722 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 49.1MB in the end (delta: 207.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:04,725 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.85ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.33ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 64.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 365.18ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 49.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 49.1MB in the end (delta: 207.9kB). 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: 9]: 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 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of to_real at line 58. Possible FailurePath: [L13] BOOLEAN INIT1, INIT2; [L14] float X, P; [L18] static float E[2], S[2]; [L18] static float E[2], S[2]; [L18] static float E[2], S[2]; [L18] static float E[2], S[2]; [L18] static float E[2], S[2]; [L18] static float E[2], S[2]; [L38] static float E2[2], S2[2]; [L38] static float E2[2], S2[2]; [L38] static float E2[2], S2[2]; [L38] static float E2[2], S2[2]; [L38] static float E2[2], S2[2]; [L38] static float E2[2], S2[2]; VAL [E2={6:0}, E={4:0}, INIT1=0, INIT2=0, P=0, S2={7:0}, S={5:0}, X=0] [L58] X = 0 [L59] INIT1 = TRUE [L60] INIT2 = TRUE VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] [L62] X = 0.98*X + 85. VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] [L63] COND FALSE !(X >= -400. && X <= 400.) VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] [L68] COND FALSE !(X >= -800. && X <= 800.) VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] [L74] CALL __VERIFIER_assert(X >= -1155. && X <= 4251.) [L9] COND TRUE !(cond) VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] [L9] reach_error() VAL [E2={6:0}, E={4:0}, INIT1=1, INIT2=1, P=0, S2={7:0}, S={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:07:04,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_iterated.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 1b2a34283d37096850c6fa7d7933fe07674b3fa81a7da8c770f866e152d89627 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:07:07,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:07:07,488 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:07:07,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:07:07,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:07:07,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:07:07,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:07:07,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:07:07,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:07:07,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:07:07,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:07:07,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:07:07,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:07:07,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:07:07,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:07:07,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:07:07,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:07:07,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:07:07,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:07:07,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:07:07,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:07:07,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:07:07,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:07:07,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:07:07,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:07:07,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:07,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:07,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:07,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:07:07,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:07,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:07,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:07,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:07,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:07:07,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:07:07,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:07:07,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:07:07,578 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:07:07,578 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:07:07,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:07:07,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:07:07,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:07:07,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:07:07,583 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 -> 1b2a34283d37096850c6fa7d7933fe07674b3fa81a7da8c770f866e152d89627 [2024-11-28 02:07:07,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:07:07,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:07:07,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:07:07,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:07:07,973 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:07:07,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/filter2_iterated.c [2024-11-28 02:07:11,005 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/813b5293a/14eb0a7e7a0946f895f5c884189192fc/FLAGce3a65d10 [2024-11-28 02:07:11,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:07:11,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c [2024-11-28 02:07:11,339 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/813b5293a/14eb0a7e7a0946f895f5c884189192fc/FLAGce3a65d10 [2024-11-28 02:07:11,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/data/813b5293a/14eb0a7e7a0946f895f5c884189192fc [2024-11-28 02:07:11,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:07:11,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:07:11,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:11,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:07:11,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:07:11,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:11,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbf1cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11, skipping insertion in model container [2024-11-28 02:07:11,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:11,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:07:11,809 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c[447,460] [2024-11-28 02:07:11,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:11,881 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:07:11,892 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_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/sv-benchmarks/c/float-benchs/filter2_iterated.c[447,460] [2024-11-28 02:07:11,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:11,938 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:07:11,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11 WrapperNode [2024-11-28 02:07:11,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:11,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:11,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:07:11,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:07:11,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:11,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:11,988 INFO L138 Inliner]: procedures = 18, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2024-11-28 02:07:11,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:11,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:07:11,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:07:11,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:07:12,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,024 INFO L175 MemorySlicer]: Split 41 memory accesses to 5 slices as follows [2, 9, 10, 9, 11]. 27 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 2, 2, 2, 2]. The 16 writes are split as follows [0, 4, 4, 4, 4]. [2024-11-28 02:07:12,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:07:12,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:07:12,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:07:12,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:07:12,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (1/1) ... [2024-11-28 02:07:12,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:12,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:07:12,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:07:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:07:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-28 02:07:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-28 02:07:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-28 02:07:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-28 02:07:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-28 02:07:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-28 02:07:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-28 02:07:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-28 02:07:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:07:12,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:07:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-28 02:07:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-28 02:07:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-28 02:07:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-28 02:07:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-28 02:07:12,357 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:07:12,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:07:32,432 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:32,432 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:32,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:32,449 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:07:32,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:32 BoogieIcfgContainer [2024-11-28 02:07:32,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:32,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:32,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:32,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:32,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:07:11" (1/3) ... [2024-11-28 02:07:32,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbd65a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:32, skipping insertion in model container [2024-11-28 02:07:32,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:11" (2/3) ... [2024-11-28 02:07:32,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbd65a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:32, skipping insertion in model container [2024-11-28 02:07:32,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:32" (3/3) ... [2024-11-28 02:07:32,459 INFO L128 eAbstractionObserver]: Analyzing ICFG filter2_iterated.c [2024-11-28 02:07:32,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:32,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG filter2_iterated.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:07:32,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:32,534 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;@2ff6b4ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:32,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:07:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-28 02:07:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 02:07:32,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:32,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:32,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 304794067, now seen corresponding path program 1 times [2024-11-28 02:07:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927370801] [2024-11-28 02:07:32,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:32,562 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-28 02:07:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:07:32,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:07:32,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:07:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:07:32,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:34,046 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-28 02:07:34,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:34,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927370801] [2024-11-28 02:07:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927370801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148093660] [2024-11-28 02:07:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:34,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:34,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:34,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:34,079 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:40,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:07:44,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:07:48,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:07:53,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:07:59,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:03,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:07,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:11,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:15,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:20,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:24,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:28,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:30,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:30,425 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. [2024-11-28 02:08:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:08:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 02:08:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:30,448 INFO L225 Difference]: With dead ends: 34 [2024-11-28 02:08:30,448 INFO L226 Difference]: Without dead ends: 18 [2024-11-28 02:08:30,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:08:30,457 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:30,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 56.3s Time] [2024-11-28 02:08:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-28 02:08:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-28 02:08:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-28 02:08:30,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 8 [2024-11-28 02:08:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:30,496 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-28 02:08:30,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-11-28 02:08:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:08:30,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:30,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:30,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-28 02:08:30,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:08:30,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash 583916189, now seen corresponding path program 1 times [2024-11-28 02:08:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:08:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944744365] [2024-11-28 02:08:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:30,702 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-28 02:08:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:08:30,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:08:30,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:08:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:31,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 02:08:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:37,380 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-28 02:08:37,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:08:37,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:08:37,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944744365] [2024-11-28 02:08:37,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944744365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:37,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:37,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:08:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175974765] [2024-11-28 02:08:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:37,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:08:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:08:37,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:08:37,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:08:37,385 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:41,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:47,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:51,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:55,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:08:59,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:03,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:04,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:08,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:11,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:14,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:20,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:24,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:28,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:32,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:36,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:40,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:44,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:48,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:52,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:53,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:09:59,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:03,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:07,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:11,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:15,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:16,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:16,905 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-28 02:10:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:10:16,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:10:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:16,922 INFO L225 Difference]: With dead ends: 24 [2024-11-28 02:10:16,922 INFO L226 Difference]: Without dead ends: 22 [2024-11-28 02:10:16,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:10:16,924 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:16,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 99.2s Time] [2024-11-28 02:10:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-28 02:10:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-28 02:10:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-28 02:10:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-28 02:10:16,928 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 9 [2024-11-28 02:10:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:16,929 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-28 02:10:16,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:10:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-28 02:10:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 02:10:16,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:16,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:16,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:10:17,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:10:17,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:10:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash 585763231, now seen corresponding path program 1 times [2024-11-28 02:10:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:10:17,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895955424] [2024-11-28 02:10:17,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:17,131 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-28 02:10:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:10:17,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:10:17,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 [2024-11-28 02:10:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:19,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:10:19,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:19,389 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-28 02:10:19,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:10:19,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:10:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895955424] [2024-11-28 02:10:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895955424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:10:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:10:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:10:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665848905] [2024-11-28 02:10:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:10:19,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:10:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:10:19,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:10:19,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:10:19,392 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:10:21,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:25,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:10:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:10:25,926 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-11-28 02:10:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:10:26,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-28 02:10:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:10:26,179 INFO L225 Difference]: With dead ends: 32 [2024-11-28 02:10:26,179 INFO L226 Difference]: Without dead ends: 20 [2024-11-28 02:10:26,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:10:26,180 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:10:26,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-28 02:10:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-28 02:10:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-28 02:10:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-28 02:10:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-28 02:10:26,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2024-11-28 02:10:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:10:26,185 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-28 02:10:26,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:10:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-28 02:10:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 02:10:26,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:10:26,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:10:26,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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)] Ended with exit code 0 [2024-11-28 02:10:26,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:10:26,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:10:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:10:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -308684530, now seen corresponding path program 1 times [2024-11-28 02:10:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:10:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875405088] [2024-11-28 02:10:26,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:10:26,389 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-28 02:10:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:10:26,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:10:26,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-28 02:10:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:10:27,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:10:27,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:10:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:10:53,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:11:03,501 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:11:11,690 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:11:15,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) ((_ to_fp 11 53) c_currentRoundingMode 85.0))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2024-11-28 02:11:19,804 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) ((_ to_fp 11 53) c_currentRoundingMode 85.0))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2024-11-28 02:11:28,058 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:11:36,222 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:11:44,444 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:11:52,624 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:00,941 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:09,110 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:17,431 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:25,740 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:29,821 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~X~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) ((_ to_fp 11 53) c_currentRoundingMode 85.0))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2024-11-28 02:12:33,895 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~X~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) ((_ to_fp 11 53) c_currentRoundingMode 85.0))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2024-11-28 02:12:42,154 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:50,430 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:12:58,716 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:13:06,999 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:13:15,449 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:13:23,889 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:13:28,025 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)))) (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) .cse3))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2024-11-28 02:13:32,187 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)))) (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) .cse3))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2024-11-28 02:13:39,130 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 24 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:13:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-28 02:13:39,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:13:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875405088] [2024-11-28 02:13:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875405088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:13:39,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:13:39,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-28 02:13:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702977892] [2024-11-28 02:13:39,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:13:39,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:13:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:13:39,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:13:39,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=33, Unknown=8, NotChecked=42, Total=110 [2024-11-28 02:13:39,133 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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-28 02:13:42,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:13:46,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:13:50,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)))) (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) .cse3))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) c_~X~0) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 02:13:54,867 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)))) (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) .cse3))))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)) c_~X~0) (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 02:13:58,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~X~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse3)) c_~X~0) (fp.leq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-28 02:14:03,058 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~X~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse3)) c_~X~0) (fp.leq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 02:14:07,140 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) .cse3)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 400.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 100.0))) c_~X~0) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 02:14:12,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:16,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:20,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:24,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:28,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:32,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:33,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:39,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:43,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:47,656 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-28 02:14:51,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:54,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:14:58,193 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 [] [2024-11-28 02:15:02,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:07,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:11,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:15,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:19,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:27,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:32,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:33,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:38,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:42,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:46,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:50,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:54,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:15:58,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:16:03,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:16:05,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 02:16:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:16:05,403 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-11-28 02:16:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:16:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-28 02:16:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:16:05,442 INFO L225 Difference]: With dead ends: 44 [2024-11-28 02:16:05,442 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 02:16:05,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=41, Invalid=42, Unknown=13, NotChecked=114, Total=210 [2024-11-28 02:16:05,445 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 123.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:16:05,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 26 Unknown, 148 Unchecked, 123.7s Time] [2024-11-28 02:16:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 02:16:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2024-11-28 02:16:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:16:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-28 02:16:05,452 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-11-28 02:16:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:16:05,453 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-28 02:16:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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-28 02:16:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-28 02:16:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 02:16:05,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:16:05,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-28 02:16:05,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-28 02:16:05,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:16:05,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:16:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:16:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1254051134, now seen corresponding path program 1 times [2024-11-28 02:16:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:16:05,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114155389] [2024-11-28 02:16:05,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:05,656 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-28 02:16:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:16:05,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:16:05,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-28 02:16:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:06,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:16:06,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:16:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:16:07,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:16:07,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:16:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114155389] [2024-11-28 02:16:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114155389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:16:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:16:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:16:07,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755007242] [2024-11-28 02:16:07,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:16:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:16:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:16:07,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:16:07,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:16:07,215 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:16:12,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 02:16:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:16:12,226 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-28 02:16:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:16:12,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-28 02:16:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:16:12,508 INFO L225 Difference]: With dead ends: 35 [2024-11-28 02:16:12,508 INFO L226 Difference]: Without dead ends: 23 [2024-11-28 02:16:12,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:16:12,511 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:16:12,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 02:16:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-28 02:16:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-28 02:16:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-28 02:16:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-28 02:16:12,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2024-11-28 02:16:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:16:12,516 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-28 02:16:12,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:16:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-28 02:16:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 02:16:12,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:16:12,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:16:12,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-28 02:16:12,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:16:12,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:16:12,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:16:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1252204092, now seen corresponding path program 1 times [2024-11-28 02:16:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:16:12,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776649933] [2024-11-28 02:16:12,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:16:12,719 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-28 02:16:12,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:16:12,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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-28 02:16:12,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90a7aa-ede3-4fb6-928c-7e38351fafa8/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 (7)] Waiting until timeout for monitored process [2024-11-28 02:16:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:16:16,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 02:16:16,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:16:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:16:18,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-28 02:16:18,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 02:16:18,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-28 02:16:39,860 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 02:17:06,364 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:14,822 WARN L286 SmtUtils]: Spent 8.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-28 02:17:18,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse4))) (.cse7 (select |c_#memory_int#2| |c_~#S~0.base|)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53))) (.cse2 (select |c_#memory_int#1| |c_~#E~0.base|))) (and (= .cse0 (let ((.cse1 (select .cse2 |c_~#E~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) .cse4)) c_~X~0) (= .cse5 (let ((.cse6 (select .cse7 (bvadd (_ bv4 32) |c_~#S~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= .cse0 (let ((.cse8 (select .cse7 |c_~#S~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse5 (let ((.cse9 (select .cse2 (bvadd |c_~#E~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))))) is different from false [2024-11-28 02:17:28,696 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:37,124 WARN L286 SmtUtils]: Spent 8.29s 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-28 02:17:37,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:17:37,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 285 treesize of output 225 [2024-11-28 02:17:38,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:17:38,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 228 [2024-11-28 02:17:38,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 156 [2024-11-28 02:17:46,725 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:17:55,946 WARN L286 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:04,433 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:14,276 WARN L286 SmtUtils]: Spent 9.84s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:22,680 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:26,959 WARN L851 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53))) (.cse8 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse5))) (.cse7 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) ((_ to_fp 11 53) c_currentRoundingMode 100.0))))) .cse5)))) (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode .cse7))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2.0 5.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse8) .cse6))))) ((_ to_fp 11 53) c_currentRoundingMode 6.0)) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse9) ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) c_~X~0) (= .cse1 .cse8) (= .cse9 .cse3) (= .cse2 .cse7)))))) is different from false [2024-11-28 02:18:35,749 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:44,323 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:18:52,917 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:03,237 WARN L286 SmtUtils]: Spent 10.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:13,154 WARN L286 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:17,489 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0))) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 85.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) .cse8))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (= .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse4) (= .cse5 .cse3) (= c_~X~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse7)))) .cse8)))) (fp.mul c_currentRoundingMode .cse9 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2.0 5.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse9))))) ((_ to_fp 11 53) c_currentRoundingMode 6.0)) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse5) ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) .cse7)))) (= .cse2 .cse10))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 02:19:26,503 WARN L286 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:35,395 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:44,101 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:19:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-28 02:19:45,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:19:56,762 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:08,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~X~0) ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 4251.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1155.0))))) is different from true [2024-11-28 02:20:17,802 WARN L286 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:26,335 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:35,549 WARN L286 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:44,103 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:20:50,034 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int#2| |c_~#S~0.base|))) (let ((.cse4 (let ((.cse12 (select .cse11 |c_~#S~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse8 (select |c_#memory_int#1| |c_~#E~0.base|))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (select .cse8 |c_~#E~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2.0 5.0)) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse9 (select .cse8 (bvadd |c_~#E~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse10 (select .cse11 (bvadd (_ bv4 32) |c_~#S~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) .cse6))))) ((_ to_fp 11 53) c_currentRoundingMode 6.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (forall ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_25|)))) (or (fp.leq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse2)))) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 4251.0)) (not (= .cse4 .cse1))))) (forall ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_25|)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse5) .cse2)))) .cse3))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1155.0))) (not (= .cse4 .cse5))))))))) is different from true [2024-11-28 02:20:59,201 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:07,806 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:17,002 WARN L286 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:25,602 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:34,396 WARN L286 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:44,245 WARN L286 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:21:53,982 WARN L286 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:22:02,775 WARN L286 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:22:07,353 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int#2| |c_~#S~0.base|))) (let ((.cse4 (let ((.cse12 (select .cse11 |c_~#S~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse8 (select |c_#memory_int#1| |c_~#E~0.base|))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 49.0 50.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~X~0)) ((_ to_fp 11 53) c_currentRoundingMode 85.0))))) (fp.mul c_currentRoundingMode .cse6 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (select .cse8 |c_~#E~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2.0 5.0)) ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse9 (select .cse8 (bvadd |c_~#E~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse10 (select .cse11 (bvadd (_ bv4 32) |c_~#S~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) .cse6))))) ((_ to_fp 11 53) c_currentRoundingMode 6.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (forall ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_25|)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse2)))) .cse3))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 1155.0))) (not (= .cse4 .cse1))))) (forall ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_25|)))) (or (fp.leq ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse5) .cse2)))) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode 4251.0)) (not (= .cse4 .cse5))))))))) is different from true [2024-11-28 02:22:16,166 WARN L286 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 02:22:25,922 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)