./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX --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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:36:22,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:36:22,578 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:36:22,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:36:22,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:36:22,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:36:22,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:36:22,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:36:22,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:36:22,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:36:22,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:36:22,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:36:22,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:36:22,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:36:22,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:36:22,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:36:22,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:36:22,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:36:22,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:36:22,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:36:22,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:36:22,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:36:22,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:36:22,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:36:22,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:36:22,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:36:22,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:36:22,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:36:22,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:36:22,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:36:22,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:36:22,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:36:22,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:22,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:36:22,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:36:22,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:36:22,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:36:22,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:36:22,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:36:22,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:36:22,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:36:22,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:36:22,693 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX 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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2024-11-08 18:36:23,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:36:23,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:36:23,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:36:23,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:36:23,176 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:36:23,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i Unable to find full path for "g++" [2024-11-08 18:36:25,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:36:25,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:36:25,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-08 18:36:25,904 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/cb39be338/e0178ec77a324ebdb2c7119e6dce133b/FLAGe319ea00c [2024-11-08 18:36:25,925 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/cb39be338/e0178ec77a324ebdb2c7119e6dce133b [2024-11-08 18:36:25,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:36:25,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:36:25,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:25,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:36:25,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:36:25,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:25" (1/1) ... [2024-11-08 18:36:25,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791de507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:25, skipping insertion in model container [2024-11-08 18:36:25,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:25" (1/1) ... [2024-11-08 18:36:25,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:36:26,242 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_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-08 18:36:26,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:26,331 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:36:26,345 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_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-08 18:36:26,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:26,472 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:36:26,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26 WrapperNode [2024-11-08 18:36:26,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:26,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:26,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:36:26,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:36:26,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,529 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-08 18:36:26,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:26,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:36:26,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:36:26,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:36:26,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:36:26,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:36:26,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:36:26,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:36:26,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:36:26,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (1/1) ... [2024-11-08 18:36:26,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:26,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:36:26,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:36:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:36:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:36:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:36:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:36:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:36:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:36:26,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:36:26,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:36:27,023 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 18:36:27,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:36:27,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:36:27,046 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:36:27,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:27 BoogieIcfgContainer [2024-11-08 18:36:27,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:36:27,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:36:27,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:36:27,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:36:27,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:36:25" (1/3) ... [2024-11-08 18:36:27,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fabbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:27, skipping insertion in model container [2024-11-08 18:36:27,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:26" (2/3) ... [2024-11-08 18:36:27,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fabbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:27, skipping insertion in model container [2024-11-08 18:36:27,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:27" (3/3) ... [2024-11-08 18:36:27,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2024-11-08 18:36:27,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:36:27,089 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:36:27,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:36:27,174 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;@109c3a3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:36:27,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:36:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:36:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:36:27,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:27,194 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:27,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2098123540, now seen corresponding path program 1 times [2024-11-08 18:36:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40052203] [2024-11-08 18:36:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:36:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:36:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:36:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:36:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:36:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:36:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:36:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:36:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:36:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:36:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:36:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 18:36:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:36:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:36:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:36:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:36:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40052203] [2024-11-08 18:36:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40052203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:36:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852631521] [2024-11-08 18:36:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:27,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:36:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:36:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:36:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:27,785 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:36:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:27,835 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-08 18:36:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:36:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-08 18:36:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:27,847 INFO L225 Difference]: With dead ends: 85 [2024-11-08 18:36:27,848 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 18:36:27,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:27,862 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:27,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:36:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 18:36:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 18:36:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:36:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-08 18:36:27,917 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2024-11-08 18:36:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:27,918 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-08 18:36:27,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:36:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-08 18:36:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:36:27,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:27,924 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:36:27,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2114642268, now seen corresponding path program 1 times [2024-11-08 18:36:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:36:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701163570] [2024-11-08 18:36:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:36:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:36:28,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:36:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:36:28,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:36:28,404 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:36:28,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:36:28,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:36:28,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 18:36:28,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:36:28,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:36:28 BoogieIcfgContainer [2024-11-08 18:36:28,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:36:28,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:36:28,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:36:28,530 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:36:28,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:27" (3/4) ... [2024-11-08 18:36:28,534 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:36:28,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:36:28,537 INFO L158 Benchmark]: Toolchain (without parser) took 2605.96ms. Allocated memory is still 161.5MB. Free memory was 98.3MB in the beginning and 121.0MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:28,537 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 134.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:28,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.86ms. Allocated memory is still 161.5MB. Free memory was 98.1MB in the beginning and 130.2MB in the end (delta: -32.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:36:28,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 128.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:28,539 INFO L158 Benchmark]: Boogie Preprocessor took 67.50ms. Allocated memory is still 161.5MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:36:28,540 INFO L158 Benchmark]: RCFGBuilder took 451.64ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 111.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 18:36:28,541 INFO L158 Benchmark]: TraceAbstraction took 1475.69ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 121.0MB in the end (delta: -10.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-08 18:36:28,541 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 161.5MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:36:28,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 161.5MB. Free memory was 134.3MB in the beginning and 134.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.86ms. Allocated memory is still 161.5MB. Free memory was 98.1MB in the beginning and 130.2MB in the end (delta: -32.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 161.5MB. Free memory was 129.5MB in the beginning and 128.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.50ms. Allocated memory is still 161.5MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 451.64ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 111.6MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1475.69ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 121.0MB in the end (delta: -10.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 161.5MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = -128; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -5; [L26] unsigned char var_1_5 = 16; [L27] unsigned char var_1_9 = 25; [L28] float var_1_10 = 2.5; [L29] signed char var_1_11 = 1; [L30] signed char var_1_12 = 4; [L31] float var_1_13 = 7.75; [L32] float var_1_14 = 64.75; [L33] float var_1_15 = 256.52; [L34] float var_1_16 = 3.25; VAL [isInitial=0, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L62] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=-5, var_1_5=16, var_1_9=25] [L63] var_1_4 = __VERIFIER_nondet_char() [L64] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=25] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=5/2, var_1_11=1, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L69] var_1_11 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L71] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L71] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=4, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L72] var_1_12 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L74] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L74] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_13=31/4, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L76] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_14=259/4, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L77] var_1_14 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L78] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_15=6413/25, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_16=13/4, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=32, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L95] RET updateVariables() [L96] CALL step() [L38] var_1_1 = (16 - 2) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=14, var_1_2=-128, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L39] COND TRUE \read(var_1_3) [L40] var_1_2 = ((((-4) < 0 ) ? -(-4) : (-4))) VAL [isInitial=1, var_1_10=5/2, var_1_11=0, var_1_12=0, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L44] COND FALSE !(var_1_4 < ((16 + var_1_11) - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=16, var_1_9=15] [L53] COND TRUE (var_1_10 * var_1_10) > var_1_10 [L54] var_1_5 = (((((25) < (5)) ? (25) : (5))) + 10) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=15] [L96] RET step() [L97] CALL, EXPR property() [L87-L88] return (((var_1_1 == ((signed char) (16 - 2))) && (var_1_3 ? (var_1_2 == ((signed char) ((((-4) < 0 ) ? -(-4) : (-4))))) : (var_1_2 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))))) && (((var_1_10 * var_1_10) > var_1_10) ? (var_1_5 == ((unsigned char) (((((25) < (5)) ? (25) : (5))) + 10))) : (var_1_5 == ((unsigned char) var_1_9)))) && ((var_1_4 < ((16 + var_1_11) - var_1_12)) ? (var_1_3 ? (var_1_10 == ((float) ((var_1_13 + 50.6f) + var_1_14))) : (var_1_10 == ((float) (var_1_15 - var_1_16)))) : (var_1_10 == ((float) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=15] [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=15] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_11=0, var_1_12=0, var_1_14=261, var_1_1=14, var_1_2=4, var_1_3=1, var_1_4=16, var_1_5=15, var_1_9=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:36:28,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX --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 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:36:31,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:36:31,729 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:36:31,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:36:31,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:36:31,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:36:31,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:36:31,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:36:31,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:36:31,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:36:31,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:36:31,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:36:31,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:36:31,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:36:31,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:36:31,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:36:31,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:36:31,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:36:31,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:36:31,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:36:31,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:36:31,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:36:31,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:36:31,797 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:36:31,797 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:36:31,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:36:31,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:36:31,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:36:31,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:36:31,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:36:31,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:36:31,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:36:31,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:36:31,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:36:31,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:31,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:36:31,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:36:31,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:36:31,804 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:36:31,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:36:31,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:36:31,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:36:31,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:36:31,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:36:31,806 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX 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 -> 7b3c7435982770834cfc131463d786948517df0041a2df466feb43cba8dfce9a [2024-11-08 18:36:32,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:36:32,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:36:32,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:36:32,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:36:32,327 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:36:32,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i Unable to find full path for "g++" [2024-11-08 18:36:34,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:36:35,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:36:35,206 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i [2024-11-08 18:36:35,216 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/3af74b02d/cb56342c3f3148ce8d97b0c69915edc8/FLAG19f7a3489 [2024-11-08 18:36:35,234 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/data/3af74b02d/cb56342c3f3148ce8d97b0c69915edc8 [2024-11-08 18:36:35,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:36:35,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:36:35,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:35,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:36:35,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:36:35,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2105d152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35, skipping insertion in model container [2024-11-08 18:36:35,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:36:35,594 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_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-08 18:36:35,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:35,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:36:35,724 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_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-62.i[915,928] [2024-11-08 18:36:35,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:36:35,809 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:36:35,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35 WrapperNode [2024-11-08 18:36:35,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:36:35,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:35,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:36:35,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:36:35,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,916 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-08 18:36:35,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:36:35,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:36:35,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:36:35,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:36:35,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:36:35,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:35,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:36:35,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:36:35,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:36:35,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:36:35,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (1/1) ... [2024-11-08 18:36:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:36:36,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:36:36,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:36:36,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:36:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:36:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:36:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:36:36,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:36:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:36:36,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:36:36,239 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:36:36,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:36:38,381 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 18:36:38,381 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:36:38,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:36:38,397 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:36:38,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:38 BoogieIcfgContainer [2024-11-08 18:36:38,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:36:38,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:36:38,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:36:38,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:36:38,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:36:35" (1/3) ... [2024-11-08 18:36:38,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffa9927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:38, skipping insertion in model container [2024-11-08 18:36:38,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:36:35" (2/3) ... [2024-11-08 18:36:38,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffa9927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:36:38, skipping insertion in model container [2024-11-08 18:36:38,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:36:38" (3/3) ... [2024-11-08 18:36:38,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-62.i [2024-11-08 18:36:38,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:36:38,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:36:38,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:36:38,536 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;@fb42fae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:36:38,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:36:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:36:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:36:38,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:38,571 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:38,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:38,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2098123540, now seen corresponding path program 1 times [2024-11-08 18:36:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609845084] [2024-11-08 18:36:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:38,609 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-08 18:36:38,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:38,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:38,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:38,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:36:38,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:36:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 18:36:39,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:36:39,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:36:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609845084] [2024-11-08 18:36:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609845084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:36:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:36:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:36:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721612424] [2024-11-08 18:36:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:36:39,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:36:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:36:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:36:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:39,095 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:36:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:36:39,133 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2024-11-08 18:36:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:36:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-08 18:36:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:36:39,144 INFO L225 Difference]: With dead ends: 85 [2024-11-08 18:36:39,144 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 18:36:39,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:36:39,156 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:36:39,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:36:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 18:36:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 18:36:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 18:36:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-08 18:36:39,219 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 91 [2024-11-08 18:36:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:36:39,220 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-08 18:36:39,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 18:36:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-08 18:36:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:36:39,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:36:39,225 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:36:39,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:39,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:36:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:36:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2114642268, now seen corresponding path program 1 times [2024-11-08 18:36:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:36:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173295043] [2024-11-08 18:36:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:36:39,431 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-08 18:36:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:36:39,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:39,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:36:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:36:39,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:36:39,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:37:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 18:37:31,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:39:49,844 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse43 ((_ sign_extend 24) c_~var_1_2~0)) (.cse45 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (bvslt .cse45 (_ bv0 32))) (.cse15 (= (_ bv4 32) .cse43)) (.cse35 ((_ zero_extend 24) c_~var_1_5~0)) (.cse42 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse45)))) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) .cse45))) (.cse4 (= c_~var_1_3~0 (_ bv0 8))) (.cse44 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse23 (bvslt .cse45 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse26 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse22 (not .cse23)) (.cse6 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0)))) (.cse7 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse44) c_~var_1_14~0))))) (.cse10 (not .cse4)) (.cse12 (= .cse43 .cse36)) (.cse32 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse20 (= .cse43 .cse42)) (.cse34 (= (_ bv15 32) .cse35)) (.cse17 (not .cse15)) (.cse19 (= (_ bv4 32) .cse42)) (.cse21 (not .cse11)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse18 (= (_ bv4 32) .cse36)) (.cse33 (forall ((~var_1_9~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_9~0) .cse35)))) (let ((.cse13 (or .cse32 .cse33)) (.cse14 (or (not .cse32) .cse33)) (.cse30 (not .cse18)) (.cse29 (not .cse19)) (.cse16 (not .cse34))) (let ((.cse27 (and (or .cse4 (let ((.cse31 (and .cse32 .cse33))) (and (or (and .cse16 (or .cse31 .cse30) (or .cse18 .cse31) .cse15) .cse11) (or (and .cse16 .cse15 (or .cse31 .cse19) (or .cse31 .cse29)) .cse21)))) (or .cse10 (and (or .cse11 (and .cse16 (or (and .cse32 .cse12 .cse33) .cse15) (or .cse17 (and .cse32 .cse33 .cse18)))) (or (and (or .cse17 (and .cse32 .cse33 .cse19)) .cse16 (or (and .cse32 .cse20 .cse33) .cse15)) .cse21))))) (.cse28 (and .cse13 .cse14))) (let ((.cse8 (or .cse11 (and (or .cse18 .cse28) .cse16 (or .cse28 .cse30) .cse15))) (.cse9 (or (and (or .cse28 .cse19) (or .cse28 .cse29) .cse16 .cse15) .cse21)) (.cse24 (or .cse27 .cse7)) (.cse25 (or .cse27 .cse6))) (and (or .cse1 (and .cse2 (or (let ((.cse3 (or (and .cse16 (or .cse17 (and .cse13 .cse14 .cse19)) (or (and .cse20 .cse13 .cse14) .cse15)) .cse21)) (.cse5 (or .cse11 (and (or (and .cse12 .cse13 .cse14) .cse15) .cse16 (or .cse17 (and .cse13 .cse18 .cse14)))))) (and (or (and .cse3 .cse4 .cse5) .cse6) (or .cse7 (and (or (and .cse8 .cse9) .cse4) (or .cse10 (and .cse3 .cse5)))))) .cse22) (or .cse23 (and .cse24 .cse25)))) (or (and (or (and .cse8 .cse2 .cse10 .cse6 .cse9) .cse22) (or .cse23 (and .cse24 .cse2 .cse25))) .cse26))))))) (or (let ((.cse41 (and (or .cse4 (and .cse32 .cse34 .cse15)) (or .cse10 (and (or .cse11 (and .cse32 .cse34 .cse12)) (or (and .cse32 .cse20 .cse34 (or .cse17 .cse19)) .cse21)))))) (let ((.cse39 (or .cse41 .cse7)) (.cse40 (or .cse41 .cse6))) (and (or (and (or (let ((.cse37 (or .cse11 (and .cse34 .cse12))) (.cse38 (or (and .cse20 .cse34) .cse21))) (and (or (and .cse37 .cse4 .cse38) .cse6) (or .cse7 (and (or (and .cse37 .cse38) .cse10) (or .cse4 (and .cse34 .cse15)))))) .cse22) .cse2 (or .cse23 (and .cse39 .cse40))) .cse1) (or .cse26 (and (or .cse23 (and .cse2 .cse39 .cse40)) (or (and .cse34 .cse2 .cse10 .cse15 .cse6) .cse22)))))) (not .cse0)))))) is different from true [2024-11-08 18:40:24,205 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-08 18:40:45,428 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse2 (let ((.cse6 (= c_~var_1_3~0 (_ bv0 8))) (.cse4 ((_ sign_extend 24) c_~var_1_2~0))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5)))))))) (not .cse6)) (or .cse6 (= (_ bv4 32) .cse4)))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0))) .cse2) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) is different from true [2024-11-08 18:40:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 18:40:59,347 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:40:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173295043] [2024-11-08 18:40:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173295043] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:40:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:40:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-08 18:40:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877656450] [2024-11-08 18:40:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:40:59,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:40:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:40:59,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:40:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=144, Unknown=3, NotChecked=78, Total=272 [2024-11-08 18:40:59,354 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:42:11,588 WARN L286 SmtUtils]: Spent 54.57s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:42:16,515 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))) (and (or (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse1 (and .cse0 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse0 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse0 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse1)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))))) is different from true [2024-11-08 18:42:19,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:42:23,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:42:25,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:42:27,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:42:30,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:42:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:30,667 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2024-11-08 18:42:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:42:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-08 18:42:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:30,691 INFO L225 Difference]: With dead ends: 78 [2024-11-08 18:42:30,691 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 18:42:30,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 105.6s TimeCoverageRelationStatistics Valid=55, Invalid=165, Unknown=6, NotChecked=116, Total=342 [2024-11-08 18:42:30,694 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:30,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 298 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 323 Unchecked, 17.1s Time] [2024-11-08 18:42:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 18:42:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-08 18:42:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:42:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-11-08 18:42:30,721 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 91 [2024-11-08 18:42:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-11-08 18:42:30,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 18:42:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-08 18:42:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:42:30,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:30,733 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:42:30,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:42:30,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:42:30,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:30,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2116489310, now seen corresponding path program 1 times [2024-11-08 18:42:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:42:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399377913] [2024-11-08 18:42:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:30,937 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-08 18:42:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:42:30,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:42:30,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:42:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:31,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:42:31,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:43:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 18:43:17,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:43:33,112 WARN L286 SmtUtils]: Spent 5.20s 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-08 18:44:33,756 WARN L286 SmtUtils]: Spent 5.51s 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-08 18:45:16,944 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse36)) (.cse38 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse16 (bvslt .cse38 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse35 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse38)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse38))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse37 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (bvslt .cse38 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse19 (not .cse1)) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse37) c_~var_1_14~0))))) (.cse6 (not .cse9)) (.cse15 (= .cse36 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse36 .cse35)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse35))) (.cse18 (not .cse16)) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (or (let ((.cse34 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse32 (or .cse34 .cse5)) (.cse33 (or .cse34 .cse13))) (and (or (and (or (let ((.cse30 (or .cse16 (and .cse27 .cse15))) (.cse31 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse30 .cse9 .cse31) .cse13) (or .cse5 (and (or (and .cse30 .cse31) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse32 .cse33))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse32 .cse33)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) (not .cse0))))))) is different from true [2024-11-08 18:46:00,898 WARN L873 $PredicateComparison]: unable to prove that (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse19 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (= c_~var_1_3~0 (_ bv0 8))) (.cse14 (bvslt .cse19 (_ bv0 32))) (.cse20 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse20)) (.cse12 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse19))))) (.cse13 (not .cse14)) (.cse15 (= .cse20 ((_ sign_extend 24) ((_ extract 7 0) .cse19)))) (.cse2 (not .cse11)) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse5 (bvslt .cse19 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse0 (not .cse5))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))))))) is different from true [2024-11-08 18:46:23,881 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (let ((.cse6 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse4 ((_ sign_extend 24) c_~var_1_2~0)) (.cse7 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse3 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse3)) .cse4) (bvslt .cse3 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse5 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse5 (_ bv0 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse5))))))) .cse6) (not .cse7)) (or (and .cse6 (= (_ bv4 32) .cse4)) .cse7)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse2) (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)) (or .cse2 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))))))) (and (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse0 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) is different from true [2024-11-08 18:46:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-08 18:46:43,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:46:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399377913] [2024-11-08 18:46:43,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399377913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:46:43,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:46:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-08 18:46:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411234396] [2024-11-08 18:46:43,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:46:43,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:46:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:46:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:46:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=229, Unknown=3, NotChecked=102, Total=420 [2024-11-08 18:46:43,404 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:46:51,104 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:47:35,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:47:52,766 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse20 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse5 (bvslt .cse20 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse11 (= c_~var_1_3~0 (_ bv0 8)))) (let ((.cse2 (not .cse11)) (.cse0 (not .cse5))) (and (= (_ bv4 8) c_~var_1_2~0) (or (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0) (let ((.cse14 (bvslt .cse20 (_ bv0 32))) (.cse19 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse19)) (.cse12 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse20))))) (.cse13 (not .cse14)) (.cse15 (= .cse19 ((_ sign_extend 24) ((_ extract 7 0) .cse20)))) (.cse18 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0)))) (.cse8 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse18) c_~var_1_14~0))))) (.cse16 (let ((.cse17 (fp.eq c_~var_1_10~0 c_~var_1_14~0))) (and (or .cse11 (and .cse17 .cse3)) (or (and (or (and .cse17 .cse12) .cse13) (or (and .cse17 .cse15) .cse14)) .cse2))))) (let ((.cse6 (or .cse8 .cse16)) (.cse7 (or .cse16 .cse4)) (.cse1 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))) (and (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (and .cse6 .cse1 .cse7)))) (or (and (or .cse5 (and .cse6 .cse7)) .cse1 (or (let ((.cse9 (or .cse14 .cse15)) (.cse10 (or .cse12 .cse13))) (and (or .cse8 (and (or .cse2 (and .cse9 .cse10)) (or .cse11 .cse3))) (or (and .cse9 .cse11 .cse10) .cse4))) .cse0)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))))))) (= (_ bv14 8) c_~var_1_1~0) (let ((.cse22 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse21 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_14~0 .cse21) (fp.geq c_~var_1_14~0 .cse22)) (and (fp.leq c_~var_1_14~0 (fp.neg .cse22)) (fp.geq c_~var_1_14~0 (fp.neg .cse21))))) .cse2 .cse0 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-08 18:47:57,072 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse37 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse12 (= (_ bv4 32) .cse37)) (.cse39 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse1 (bvslt .cse39 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse0 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (.cse16 (bvslt .cse39 (_ bv0 32))) (.cse28 (not .cse12)) (.cse26 ((_ zero_extend 24) c_~var_1_5~0)) (.cse36 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse39)))) (.cse29 ((_ sign_extend 24) ((_ extract 7 0) .cse39))) (.cse38 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (let ((.cse20 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse21 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse13 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0)))) (.cse5 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse38) c_~var_1_14~0))))) (.cse15 (= .cse37 .cse29)) (.cse23 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (= .cse37 .cse36)) (.cse27 (= (_ bv15 32) .cse26)) (.cse24 (or .cse28 (= (_ bv4 32) .cse36))) (.cse18 (not .cse16)) (.cse30 (not .cse0)) (.cse6 (not .cse9)) (.cse19 (not .cse1))) (and (or .cse0 (let ((.cse25 ((_ zero_extend 24) c_~var_1_9~0))) (let ((.cse14 (or .cse28 (= (_ bv4 32) .cse29))) (.cse10 (or (= .cse25 (_ bv15 32)) (not .cse27))) (.cse11 (= .cse25 .cse26))) (let ((.cse22 (and (or (and .cse23 .cse11 .cse12) .cse9) (or .cse6 (and (or .cse16 (and .cse23 .cse11 .cse14 .cse15)) (or (and .cse23 .cse17 .cse24 .cse10 .cse11) .cse18)))))) (let ((.cse2 (or .cse5 .cse22)) (.cse3 (or .cse22 .cse13))) (and (or (and (or .cse1 (and .cse2 .cse3)) .cse4 (or (let ((.cse7 (or (and .cse17 .cse10 .cse11) .cse18)) (.cse8 (or (and .cse11 .cse14 .cse15) .cse16))) (and (or .cse5 (and (or .cse6 (and .cse7 .cse8)) (or .cse9 (and .cse10 .cse11 .cse12)))) (or (and .cse9 .cse7 .cse8) .cse13))) .cse19)) .cse20) (or .cse21 (and (or (and .cse10 .cse11 .cse4 .cse6 .cse12 .cse13) .cse19) (or .cse1 (and .cse4 .cse2 .cse3)))))))))) (= (_ bv4 8) c_~var_1_2~0) (fp.leq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (= (_ bv14 8) c_~var_1_1~0) .cse30 (or (let ((.cse35 (and (or .cse9 (and .cse23 .cse27 .cse12)) (or .cse6 (and (or .cse16 (and .cse23 .cse27 .cse15)) (or (and .cse23 .cse17 .cse27 .cse24) .cse18)))))) (let ((.cse33 (or .cse35 .cse5)) (.cse34 (or .cse35 .cse13))) (and (or (and (or (let ((.cse31 (or .cse16 (and .cse27 .cse15))) (.cse32 (or (and .cse17 .cse27) .cse18))) (and (or (and .cse31 .cse9 .cse32) .cse13) (or .cse5 (and (or (and .cse31 .cse32) .cse6) (or .cse9 (and .cse27 .cse12)))))) .cse19) .cse4 (or .cse1 (and .cse33 .cse34))) .cse20) (or .cse21 (and (or .cse1 (and .cse4 .cse33 .cse34)) (or (and .cse27 .cse4 .cse6 .cse12 .cse13) .cse19)))))) .cse30) (fp.geq c_~var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) .cse6 (= c_~var_1_5~0 c_~var_1_9~0) .cse19 (= c_~var_1_14~0 c_~var_1_10~0) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2024-11-08 18:48:00,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:48:03,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:48:04,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:48:10,937 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse5 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse9 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse1 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse11 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0))) (and (or (let ((.cse0 (let ((.cse4 (let ((.cse7 ((_ sign_extend 24) c_~var_1_2~0)) (.cse10 (= c_~var_1_3~0 (_ bv0 8)))) (and (or (and (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse6 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse6 (_ bv0 32)) (= ((_ sign_extend 24) ((_ extract 7 0) .cse6)) .cse7) (bvslt .cse6 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0)))))) (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse8 ((_ sign_extend 24) ~var_1_4~0))) (or (bvslt .cse8 (bvadd (bvneg ((_ sign_extend 24) ~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) ~var_1_11~0))) (not (bvslt .cse8 (_ bv0 32))) (= .cse7 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse8))))))) .cse9) (not .cse10)) (or (and .cse9 (= (_ bv4 32) .cse7)) .cse10)))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))) .cse4) .cse5 (or .cse4 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse3) c_~var_1_14~0)))))))) (and (or .cse0 .cse1) (or .cse0 .cse2))) .cse11) (or (and (or .cse5 .cse2) (or (and .cse5 .cse9) .cse1)) .cse11))) is different from true [2024-11-08 18:48:13,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:15,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:19,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:48:34,713 INFO L93 Difference]: Finished difference Result 271 states and 372 transitions. [2024-11-08 18:48:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 18:48:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 91 [2024-11-08 18:48:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:48:34,727 INFO L225 Difference]: With dead ends: 271 [2024-11-08 18:48:34,728 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 18:48:34,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 93.9s TimeCoverageRelationStatistics Valid=202, Invalid=518, Unknown=6, NotChecked=330, Total=1056 [2024-11-08 18:48:34,731 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 206 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 119 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 818 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:48:34,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 527 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 601 Invalid, 1 Unknown, 818 Unchecked, 53.3s Time] [2024-11-08 18:48:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 18:48:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 121. [2024-11-08 18:48:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 76 states have internal predecessors, (88), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 18:48:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2024-11-08 18:48:34,788 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 91 [2024-11-08 18:48:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:48:34,789 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2024-11-08 18:48:34,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:48:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2024-11-08 18:48:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 18:48:34,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:48:34,792 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:48:34,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:48:34,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:48:34,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:48:34,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:48:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash -405317666, now seen corresponding path program 1 times [2024-11-08 18:48:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:48:34,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124687943] [2024-11-08 18:48:34,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:48:34,995 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-08 18:48:34,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:48:35,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:48:35,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ecf1c0e-b00e-4e6f-8327-32d9098ce172/bin/uautomizer-verify-jihMAELWvX/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-08 18:48:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:48:35,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:48:35,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:50:07,171 WARN L286 SmtUtils]: Spent 7.90s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:13,053 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:50:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-08 18:50:18,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:51:09,259 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:51:24,902 WARN L286 SmtUtils]: Spent 5.15s 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)