./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:09:40,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:09:40,267 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:09:40,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:09:40,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:09:40,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:09:40,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:09:40,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:09:40,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:09:40,301 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:09:40,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:09:40,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:09:40,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:09:40,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:09:40,304 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:09:40,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:09:40,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:09:40,305 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:09:40,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:09:40,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:09:40,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:09:40,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:09:40,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:09:40,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:09:40,309 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:09:40,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:09:40,309 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:09:40,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:09:40,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:09:40,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:09:40,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:09:40,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:40,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:09:40,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:09:40,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:09:40,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:09:40,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:09:40,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:09:40,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:09:40,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:09:40,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:09:40,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:09:40,315 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_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2023-11-29 00:09:40,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:09:40,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:09:40,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:09:40,576 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:09:40,577 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:09:40,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:43,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:09:43,544 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:09:43,545 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:43,552 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/ba3ed707c/62eb816074244747be1d2a50f2070402/FLAG9103be210 [2023-11-29 00:09:43,566 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/ba3ed707c/62eb816074244747be1d2a50f2070402 [2023-11-29 00:09:43,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:09:43,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:09:43,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:43,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:09:43,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:09:43,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9e6963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43, skipping insertion in model container [2023-11-29 00:09:43,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,603 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:09:43,736 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2023-11-29 00:09:43,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:43,775 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:09:43,785 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2023-11-29 00:09:43,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:43,816 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:09:43,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43 WrapperNode [2023-11-29 00:09:43,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:43,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:43,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:09:43,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:09:43,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,855 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-11-29 00:09:43,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:43,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:09:43,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:09:43,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:09:43,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,880 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:09:43,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:09:43,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:09:43,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:09:43,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:09:43,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (1/1) ... [2023-11-29 00:09:43,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:09:43,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:09:43,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:09:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:09:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:09:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:09:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:09:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:09:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:09:44,022 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:09:44,024 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:09:44,170 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:09:44,214 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:09:44,214 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:09:44,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:44 BoogieIcfgContainer [2023-11-29 00:09:44,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:09:44,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:09:44,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:09:44,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:09:44,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:09:43" (1/3) ... [2023-11-29 00:09:44,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c291647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:44, skipping insertion in model container [2023-11-29 00:09:44,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:43" (2/3) ... [2023-11-29 00:09:44,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c291647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:44, skipping insertion in model container [2023-11-29 00:09:44,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:44" (3/3) ... [2023-11-29 00:09:44,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:44,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:09:44,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:09:44,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:09:44,290 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64dcdda9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:09:44,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:09:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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) [2023-11-29 00:09:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:09:44,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:44,303 INFO L195 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] [2023-11-29 00:09:44,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:44,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1848409247, now seen corresponding path program 1 times [2023-11-29 00:09:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:09:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828855664] [2023-11-29 00:09:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:09:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:09:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:09:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:09:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 00:09:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:09:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:09:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 00:09:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:09:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:09:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:09:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:09:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:09:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:09:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:09:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:09:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:09:44,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828855664] [2023-11-29 00:09:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828855664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:09:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:09:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:09:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828649926] [2023-11-29 00:09:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:09:44,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:09:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:09:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:09:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:09:44,636 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2023-11-29 00:09:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:09:44,672 INFO L93 Difference]: Finished difference Result 73 states and 124 transitions. [2023-11-29 00:09:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:09:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 85 [2023-11-29 00:09:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:09:44,683 INFO L225 Difference]: With dead ends: 73 [2023-11-29 00:09:44,683 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 00:09:44,686 INFO L412 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 [2023-11-29 00:09:44,689 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:09:44,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:09:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 00:09:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 00:09:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2023-11-29 00:09:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-11-29 00:09:44,731 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 85 [2023-11-29 00:09:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:09:44,731 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-29 00:09:44,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2023-11-29 00:09:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-11-29 00:09:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:09:44,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:44,736 INFO L195 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] [2023-11-29 00:09:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:09:44,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:44,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -850343593, now seen corresponding path program 1 times [2023-11-29 00:09:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:09:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165887770] [2023-11-29 00:09:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:09:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:09:44,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:09:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:09:44,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:09:44,932 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:09:44,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:09:44,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:09:44,939 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 00:09:44,942 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:09:45,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:09:45 BoogieIcfgContainer [2023-11-29 00:09:45,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:09:45,007 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:09:45,007 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:09:45,007 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:09:45,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:44" (3/4) ... [2023-11-29 00:09:45,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:09:45,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:09:45,013 INFO L158 Benchmark]: Toolchain (without parser) took 1442.66ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 83.3MB in the end (delta: 64.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2023-11-29 00:09:45,013 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:45,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.49ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 149.2MB in the end (delta: -1.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:09:45,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 148.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:45,015 INFO L158 Benchmark]: Boogie Preprocessor took 37.25ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 146.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:09:45,016 INFO L158 Benchmark]: RCFGBuilder took 320.79ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 130.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:09:45,017 INFO L158 Benchmark]: TraceAbstraction took 787.90ms. Allocated memory is still 184.5MB. Free memory was 130.4MB in the beginning and 84.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2023-11-29 00:09:45,018 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 184.5MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 928.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:45,021 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.19ms. Allocated memory is still 117.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.49ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 149.2MB in the end (delta: -1.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 148.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.25ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 146.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.79ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 130.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 787.90ms. Allocated memory is still 184.5MB. Free memory was 130.4MB in the beginning and 84.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 184.5MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 928.5kB). 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 someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 48 mSDtfsCounter, 3 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=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 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 [2023-11-29 00:09:45,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:09:47,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:09:47,148 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:09:47,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:09:47,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:09:47,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:09:47,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:09:47,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:09:47,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:09:47,196 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:09:47,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:09:47,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:09:47,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:09:47,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:09:47,199 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:09:47,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:09:47,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:09:47,200 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:09:47,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:09:47,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:09:47,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:09:47,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:09:47,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:09:47,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:09:47,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:09:47,205 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:09:47,205 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:09:47,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:09:47,206 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:09:47,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:09:47,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:09:47,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:09:47,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:09:47,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:47,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:09:47,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:09:47,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:09:47,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:09:47,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:09:47,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:09:47,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:09:47,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:09:47,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:09:47,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:09:47,210 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:09:47,211 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_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2023-11-29 00:09:47,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:09:47,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:09:47,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:09:47,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:09:47,534 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:09:47,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:50,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:09:50,533 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:09:50,533 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:50,543 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/5cb3418dd/100b5ad7ace94cda82e2b22ff94d9180/FLAG5bec7b093 [2023-11-29 00:09:50,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/data/5cb3418dd/100b5ad7ace94cda82e2b22ff94d9180 [2023-11-29 00:09:50,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:09:50,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:09:50,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:50,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:09:50,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:09:50,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d740944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50, skipping insertion in model container [2023-11-29 00:09:50,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:09:50,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2023-11-29 00:09:50,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:50,800 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:09:50,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i[915,928] [2023-11-29 00:09:50,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:50,851 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:09:50,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50 WrapperNode [2023-11-29 00:09:50,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:50,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:50,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:09:50,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:09:50,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,896 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-29 00:09:50,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:50,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:09:50,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:09:50,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:09:50,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,930 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:09:50,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:09:50,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:09:50,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:09:50,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:09:50,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (1/1) ... [2023-11-29 00:09:50,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:09:50,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:09:51,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:09:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:09:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:09:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:09:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:09:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:09:51,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:09:51,148 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:09:51,150 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:09:51,710 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:09:51,761 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:09:51,762 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:09:51,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:51 BoogieIcfgContainer [2023-11-29 00:09:51,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:09:51,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:09:51,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:09:51,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:09:51,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:09:50" (1/3) ... [2023-11-29 00:09:51,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e135a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:51, skipping insertion in model container [2023-11-29 00:09:51,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:50" (2/3) ... [2023-11-29 00:09:51,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e135a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:51, skipping insertion in model container [2023-11-29 00:09:51,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:51" (3/3) ... [2023-11-29 00:09:51,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2023-11-29 00:09:51,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:09:51,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:09:51,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:09:51,832 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@702da85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:09:51,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:09:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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) [2023-11-29 00:09:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:09:51,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:51,846 INFO L195 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] [2023-11-29 00:09:51,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:51,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1848409247, now seen corresponding path program 1 times [2023-11-29 00:09:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:09:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999688711] [2023-11-29 00:09:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:51,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:09:51,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:09:51,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:09:51,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:09:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:52,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:09:52,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:09:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2023-11-29 00:09:52,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:09:52,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:09:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999688711] [2023-11-29 00:09:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999688711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:09:52,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:09:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:09:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083968211] [2023-11-29 00:09:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:09:52,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:09:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:09:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:09:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:09:52,203 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:09:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:09:52,430 INFO L93 Difference]: Finished difference Result 73 states and 124 transitions. [2023-11-29 00:09:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:09:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 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 85 [2023-11-29 00:09:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:09:52,445 INFO L225 Difference]: With dead ends: 73 [2023-11-29 00:09:52,445 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 00:09:52,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:09:52,451 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:09:52,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:09:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 00:09:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 00:09:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2023-11-29 00:09:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-11-29 00:09:52,484 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 85 [2023-11-29 00:09:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:09:52,484 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-29 00:09:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:09:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-11-29 00:09:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:09:52,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:52,489 INFO L195 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] [2023-11-29 00:09:52,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:09:52,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:09:52,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:52,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -850343593, now seen corresponding path program 1 times [2023-11-29 00:09:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:09:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697919420] [2023-11-29 00:09:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:09:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:09:52,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:09:52,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:09:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:52,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 00:09:52,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:10:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-29 00:10:36,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:11:16,826 WARN L293 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:11:21,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697919420] [2023-11-29 00:11:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697919420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:11:21,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [234600780] [2023-11-29 00:11:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:21,040 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:11:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:11:21,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:11:21,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-11-29 00:11:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:21,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 00:11:21,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-11-29 00:12:42,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [234600780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:17,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-29 00:13:17,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279267332] [2023-11-29 00:13:17,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:17,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 00:13:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:13:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 00:13:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:13:17,546 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-11-29 00:13:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:25,507 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-11-29 00:13:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:13:25,509 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 85 [2023-11-29 00:13:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:25,511 INFO L225 Difference]: With dead ends: 52 [2023-11-29 00:13:25,511 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 00:13:25,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:13:25,514 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:25,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 170 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:13:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 00:13:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-11-29 00:13:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 00:13:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2023-11-29 00:13:25,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 85 [2023-11-29 00:13:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:25,529 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2023-11-29 00:13:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-11-29 00:13:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2023-11-29 00:13:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:13:25,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:25,532 INFO L195 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] [2023-11-29 00:13:25,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:13:25,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2023-11-29 00:13:25,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:13:25,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:13:25,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -590940826, now seen corresponding path program 1 times [2023-11-29 00:13:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:13:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547246921] [2023-11-29 00:13:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:25,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:13:25,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:13:25,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:13:25,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:13:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:26,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 00:13:26,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:17:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-11-29 00:17:06,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:38,623 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse9 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse8 (bvslt c_~var_1_7~0 c_~var_1_8~0)) (.cse34 (or .cse21 .cse9)) (.cse35 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse9)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0))) (let ((.cse7 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse17 (not .cse3)) (.cse20 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse25 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse24 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (and .cse35 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse15 (and .cse34 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (not .cse8))) (let ((.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse4 (or .cse5 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse14 (or .cse15 .cse8)) (.cse16 (or .cse12 .cse8)) (.cse23 (not .cse24)) (.cse22 (not .cse25)) (.cse19 (not .cse20)) (.cse0 (and .cse9 (or .cse21 .cse17 .cse13))) (.cse1 (not .cse18)) (.cse6 (not .cse7))) (and (or (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and .cse4 (or (and (or .cse5 .cse6) (or .cse5 .cse7)) .cse8) .cse9 (or (and (or .cse10 .cse7) (or .cse10 .cse6)) .cse8) .cse11)) (or (and (or (and (or .cse12 .cse6) (or .cse12 .cse7)) .cse13) .cse14 (or (and (or .cse15 .cse6) (or .cse15 .cse7)) .cse13) .cse16) .cse17)) .cse18)) .cse19) (or .cse20 (and (or (and .cse9 (or .cse21 .cse22 .cse13)) .cse1 .cse2) (or (and (or (and .cse4 .cse9 (or (and (or .cse5 .cse23) (or .cse5 .cse24)) .cse8) .cse11 (or (and (or .cse10 .cse23) (or .cse10 .cse24)) .cse8)) .cse25) (or .cse22 (and (or (and (or .cse15 .cse23) (or .cse15 .cse24)) .cse13) .cse14 (or (and (or .cse12 .cse23) (or .cse12 .cse24)) .cse13) .cse16))) .cse18))) (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse26 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse27 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))))) (let ((.cse31 (and .cse35 .cse27)) (.cse30 (and .cse26 .cse34))) (let ((.cse32 (or .cse30 .cse8)) (.cse33 (or .cse31 .cse8)) (.cse28 (or .cse26 .cse13)) (.cse29 (or .cse27 .cse13))) (and (or (and (or .cse1 (and (or .cse9 .cse25) (or .cse22 (and .cse9 (or .cse21 .cse13))))) (or .cse18 (and (or (and (or (and (or .cse26 .cse23) (or .cse24 .cse26)) .cse8) (or (and (or .cse27 .cse24) (or .cse27 .cse23)) .cse8) .cse28 .cse29) .cse25) (or (and (or (and (or .cse24 .cse30) (or .cse30 .cse23)) .cse13) (or (and (or .cse31 .cse24) (or .cse31 .cse23)) .cse13) .cse32 .cse33) .cse22)))) .cse20) (or .cse19 (and (or .cse0 .cse1) (or .cse18 (and (or .cse17 (and (or (and (or .cse31 .cse6) (or .cse31 .cse7)) .cse13) (or (and (or .cse30 .cse6) (or .cse7 .cse30)) .cse13) .cse32 .cse33)) (or .cse3 (and (or (and (or .cse7 .cse26) (or .cse26 .cse6)) .cse8) .cse28 .cse29 (or (and (or .cse27 .cse6) (or .cse27 .cse7)) .cse8))))))))))))))))) is different from true [2023-11-29 00:19:34,679 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse17 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse16 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse11 (= (_ bv0 8) c_~var_1_2~0)) (.cse3 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse10 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse21 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse0 (not .cse12)) (.cse1 (and (or .cse5 .cse22 .cse10) .cse21)) (.cse6 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse8 (not .cse3)) (.cse9 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse2 (not .cse11)) (.cse23 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse13 (and .cse21 (or .cse22 .cse10 .cse16))) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse20 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse14 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse24 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse26 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse19 (not .cse17)) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse7 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse2) (or (and (or .cse3 .cse4) (or .cse5 .cse6 .cse4) (or .cse7 .cse8) (or .cse9 .cse10 .cse4) (or .cse9 .cse10 .cse7) (or .cse5 .cse6 .cse7) (or .cse7 .cse3) (or .cse4 .cse8)) .cse11))) (or .cse12 (and (or .cse2 .cse13) (or .cse11 (let ((.cse15 (and .cse4 (or .cse22 .cse21))) (.cse18 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse21) .cse7))) (and (or .cse14 .cse15 .cse16) (or .cse7 .cse17) (or .cse14 .cse18 .cse16) (or (and (or .cse17 .cse15) (or .cse15 .cse19)) .cse10 .cse16) (or .cse4 .cse19) (or .cse17 .cse4) (or .cse10 .cse20 .cse7) (or .cse10 .cse20 .cse4) (or .cse10 .cse16 (and (or .cse18 .cse17) (or .cse18 .cse19))) (or .cse7 .cse19))))))))) (or .cse0 (and (or .cse1 .cse2 .cse23) (or (and (or .cse24 .cse3) .cse21 (or .cse9 .cse25 .cse10) (or .cse25 .cse8) (or .cse24 .cse8) (or .cse5 .cse6 .cse24) (or .cse25 .cse3) (or .cse5 .cse25 .cse6) (or .cse5 .cse10 (and (or .cse8 .cse26) (or .cse3 .cse26))) (or .cse5 .cse10 (and (or .cse27 .cse3) (or .cse27 .cse8))) (or .cse9 .cse10 .cse24)) .cse11))) (or (and (or .cse2 .cse23 .cse13) (or .cse11 (and (or .cse25 .cse19) (or .cse25 .cse10 .cse20) (or .cse14 .cse25 .cse16) (or .cse25 .cse17) (or .cse24 .cse19) .cse21 (or .cse10 .cse20 .cse24) (or .cse14 .cse24 .cse16) (or .cse24 .cse17) (or (and (or .cse17 .cse26) (or .cse19 .cse26)) .cse10 .cse16) (or .cse10 (and (or .cse27 .cse19) (or .cse27 .cse17)) .cse16)))) .cse12)))) is different from true [2023-11-29 00:19:48,955 WARN L293 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 34 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:19:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-29 00:19:53,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:19:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547246921] [2023-11-29 00:19:53,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547246921] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:19:53,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:19:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-11-29 00:19:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34673691] [2023-11-29 00:19:53,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:19:53,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:19:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:19:53,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:19:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=151, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:19:53,618 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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) [2023-11-29 00:20:11,232 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse17 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse16 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse11 (= (_ bv0 8) c_~var_1_2~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse10 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse21 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse1 (and (or .cse5 .cse22 .cse10) .cse21)) (.cse6 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse9 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse2 (not .cse11)) (.cse23 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse13 (and .cse21 (or .cse22 .cse10 .cse16))) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse20 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse14 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse24 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse26 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse0 (not .cse12)) (.cse19 (not .cse17)) (.cse8 (not .cse3))) (and (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse7 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse2) (or (and (or .cse3 .cse4) (or .cse5 .cse6 .cse4) (or .cse7 .cse8) (or .cse9 .cse10 .cse4) (or .cse9 .cse10 .cse7) (or .cse5 .cse6 .cse7) (or .cse7 .cse3) (or .cse4 .cse8)) .cse11))) (or .cse12 (and (or .cse2 .cse13) (or .cse11 (let ((.cse15 (and .cse4 (or .cse22 .cse21))) (.cse18 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse21) .cse7))) (and (or .cse14 .cse15 .cse16) (or .cse7 .cse17) (or .cse14 .cse18 .cse16) (or (and (or .cse17 .cse15) (or .cse15 .cse19)) .cse10 .cse16) (or .cse4 .cse19) (or .cse17 .cse4) (or .cse10 .cse20 .cse7) (or .cse10 .cse20 .cse4) (or .cse10 .cse16 (and (or .cse18 .cse17) (or .cse18 .cse19))) (or .cse7 .cse19))))))))) (or .cse0 (and (or .cse1 .cse2 .cse23) (or (and (or .cse24 .cse3) .cse21 (or .cse9 .cse25 .cse10) (or .cse25 .cse8) (or .cse24 .cse8) (or .cse5 .cse6 .cse24) (or .cse25 .cse3) (or .cse5 .cse25 .cse6) (or .cse5 .cse10 (and (or .cse8 .cse26) (or .cse3 .cse26))) (or .cse5 .cse10 (and (or .cse27 .cse3) (or .cse27 .cse8))) (or .cse9 .cse10 .cse24)) .cse11))) (or (and (or .cse2 .cse23 .cse13) (or .cse11 (and (or .cse25 .cse19) (or .cse25 .cse10 .cse20) (or .cse14 .cse25 .cse16) (or .cse25 .cse17) (or .cse24 .cse19) .cse21 (or .cse10 .cse20 .cse24) (or .cse14 .cse24 .cse16) (or .cse24 .cse17) (or (and (or .cse17 .cse26) (or .cse19 .cse26)) .cse10 .cse16) (or .cse10 (and (or .cse27 .cse19) (or .cse27 .cse17)) .cse16)))) .cse12) .cse11 (let ((.cse28 (= c_~var_1_7~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|))) (or (and .cse0 (or (and .cse28 .cse19) (and (= c_~var_1_6~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) .cse17))) (and (or (and .cse28 .cse8) (and (= c_~var_1_5~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) .cse3)) .cse12))) (let ((.cse30 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse29 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse29))) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse30)))) (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse30)) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse29))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:20:13,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:20:17,190 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse9 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse8 (bvslt c_~var_1_7~0 c_~var_1_8~0)) (.cse36 (or .cse22 .cse9)) (.cse37 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse9)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0))) (let ((.cse7 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse17 (not .cse3)) (.cse20 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse25 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse24 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (and .cse37 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse15 (and .cse36 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (not .cse8))) (let ((.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse4 (or .cse5 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse14 (or .cse15 .cse8)) (.cse16 (or .cse12 .cse8)) (.cse23 (not .cse24)) (.cse21 (not .cse25)) (.cse19 (not .cse20)) (.cse0 (and .cse9 (or .cse22 .cse17 .cse13))) (.cse1 (not .cse18)) (.cse6 (not .cse7))) (and (or (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and .cse4 (or (and (or .cse5 .cse6) (or .cse5 .cse7)) .cse8) .cse9 (or (and (or .cse10 .cse7) (or .cse10 .cse6)) .cse8) .cse11)) (or (and (or (and (or .cse12 .cse6) (or .cse12 .cse7)) .cse13) .cse14 (or (and (or .cse15 .cse6) (or .cse15 .cse7)) .cse13) .cse16) .cse17)) .cse18)) .cse19) (or (and (or .cse17 .cse13) .cse20) (and .cse19 (or .cse21 .cse13))) (or .cse20 (and (or (and .cse9 (or .cse22 .cse21 .cse13)) .cse1 .cse2) (or (and (or (and .cse4 .cse9 (or (and (or .cse5 .cse23) (or .cse5 .cse24)) .cse8) .cse11 (or (and (or .cse10 .cse23) (or .cse10 .cse24)) .cse8)) .cse25) (or .cse21 (and (or (and (or .cse15 .cse23) (or .cse15 .cse24)) .cse13) .cse14 (or (and (or .cse12 .cse23) (or .cse12 .cse24)) .cse13) .cse16))) .cse18))) .cse18 (let ((.cse27 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse26 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse26))) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse27)))) (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse27)) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse26))))) (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse28 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse29 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))))) (let ((.cse33 (and .cse37 .cse29)) (.cse32 (and .cse28 .cse36))) (let ((.cse34 (or .cse32 .cse8)) (.cse35 (or .cse33 .cse8)) (.cse30 (or .cse28 .cse13)) (.cse31 (or .cse29 .cse13))) (and (or (and (or .cse1 (and (or .cse9 .cse25) (or .cse21 (and .cse9 (or .cse22 .cse13))))) (or .cse18 (and (or (and (or (and (or .cse28 .cse23) (or .cse24 .cse28)) .cse8) (or (and (or .cse29 .cse24) (or .cse29 .cse23)) .cse8) .cse30 .cse31) .cse25) (or (and (or (and (or .cse24 .cse32) (or .cse32 .cse23)) .cse13) (or (and (or .cse33 .cse24) (or .cse33 .cse23)) .cse13) .cse34 .cse35) .cse21)))) .cse20) (or .cse19 (and (or .cse0 .cse1) (or .cse18 (and (or .cse17 (and (or (and (or .cse33 .cse6) (or .cse33 .cse7)) .cse13) (or (and (or .cse32 .cse6) (or .cse7 .cse32)) .cse13) .cse34 .cse35)) (or .cse3 (and (or (and (or .cse7 .cse28) (or .cse28 .cse6)) .cse8) .cse30 .cse31 (or (and (or .cse29 .cse6) (or .cse29 .cse7)) .cse8)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2023-11-29 00:20:22,982 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse20 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse16 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse4 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse6 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse24 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse7 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse3 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse0 (not .cse7)) (.cse1 (and (or .cse4 .cse5 .cse6) .cse24)) (.cse12 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse14 (not .cse10)) (.cse15 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse9 (not .cse16)) (.cse26 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse23 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse18 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse22 (not .cse20)) (.cse28 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse17 (and .cse24 (or .cse5 .cse6 .cse8)))) (and (or .cse0 .cse1 .cse2) (or .cse3 (and (or .cse4 .cse5 .cse0 .cse6) (or .cse5 .cse6 .cse7 .cse8))) (or .cse3 (let ((.cse13 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse9) (or (and (or .cse10 .cse11) (or .cse4 .cse12 .cse11) (or .cse13 .cse14) (or .cse15 .cse6 .cse11) (or .cse15 .cse6 .cse13) (or .cse4 .cse12 .cse13) (or .cse13 .cse10) (or .cse11 .cse14)) .cse16))) (or .cse7 (and (or .cse9 .cse17) (or .cse16 (let ((.cse19 (and .cse11 (or .cse5 .cse24))) (.cse21 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse24) .cse13))) (and (or .cse18 .cse19 .cse8) (or .cse13 .cse20) (or .cse18 .cse21 .cse8) (or (and (or .cse20 .cse19) (or .cse19 .cse22)) .cse6 .cse8) (or .cse11 .cse22) (or .cse20 .cse11) (or .cse6 .cse23 .cse13) (or .cse6 .cse23 .cse11) (or .cse6 .cse8 (and (or .cse21 .cse20) (or .cse21 .cse22))) (or .cse13 .cse22))))))))) (or .cse0 (and (or .cse1 .cse9 .cse2) (or (and (or .cse25 .cse10) .cse24 (or .cse15 .cse26 .cse6) (or .cse26 .cse14) (or .cse25 .cse14) (or .cse4 .cse12 .cse25) (or .cse26 .cse10) (or .cse4 .cse26 .cse12) (or .cse4 .cse6 (and (or .cse14 .cse27) (or .cse10 .cse27))) (or .cse4 .cse6 (and (or .cse28 .cse10) (or .cse28 .cse14))) (or .cse15 .cse6 .cse25)) .cse16))) (or (and (or .cse9 .cse2 .cse17) (or .cse16 (and (or .cse26 .cse22) (or .cse26 .cse6 .cse23) (or .cse18 .cse26 .cse8) (or .cse26 .cse20) (or .cse25 .cse22) .cse24 (or .cse6 .cse23 .cse25) (or .cse18 .cse25 .cse8) (or .cse25 .cse20) (or (and (or .cse20 .cse27) (or .cse22 .cse27)) .cse6 .cse8) (or .cse6 (and (or .cse28 .cse22) (or .cse28 .cse20)) .cse8)))) .cse7) (or .cse2 .cse17 .cse7)))) is different from true [2023-11-29 00:20:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:20:23,735 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2023-11-29 00:20:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:20:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 86 [2023-11-29 00:20:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:20:23,739 INFO L225 Difference]: With dead ends: 108 [2023-11-29 00:20:23,739 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 00:20:23,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=121, Invalid=314, Unknown=5, NotChecked=210, Total=650 [2023-11-29 00:20:23,742 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:20:23,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 324 Unchecked, 15.0s Time] [2023-11-29 00:20:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 00:20:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 56. [2023-11-29 00:20:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 00:20:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2023-11-29 00:20:23,761 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 86 [2023-11-29 00:20:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:20:23,762 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2023-11-29 00:20:23,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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) [2023-11-29 00:20:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2023-11-29 00:20:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:20:23,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:20:23,766 INFO L195 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] [2023-11-29 00:20:23,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:20:23,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:20:23,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:20:23,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:20:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -591000408, now seen corresponding path program 1 times [2023-11-29 00:20:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:20:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174840176] [2023-11-29 00:20:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:20:23,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:20:23,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:20:23,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:20:23,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:20:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:24,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:20:24,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:21:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-29 00:21:11,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:30,306 WARN L293 SmtUtils]: Spent 17.72s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:23:30,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:23:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174840176] [2023-11-29 00:23:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174840176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1947279480] [2023-11-29 00:23:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:23:30,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:23:30,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:23:30,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_067264a2-f19d-4cbe-a17f-55fc3edb31a2/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-29 00:23:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:31,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 00:23:31,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:24:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-29 00:24:09,242 INFO L327 TraceCheckSpWp]: Computing backward predicates...