./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:27:16,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:27:16,455 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:27:16,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:27:16,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:27:16,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:27:16,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:27:16,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:27:16,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:27:16,488 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:27:16,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:27:16,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:27:16,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:27:16,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:27:16,491 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:27:16,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:27:16,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:27:16,492 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:27:16,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:27:16,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:27:16,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:27:16,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:27:16,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:27:16,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:27:16,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:27:16,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:27:16,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:27:16,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:27:16,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:27:16,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:27:16,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:27:16,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:16,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:27:16,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:27:16,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:27:16,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:27:16,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:27:16,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:27:16,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:27:16,502 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:27:16,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:27:16,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:27:16,502 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2023-11-29 01:27:16,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:27:16,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:27:16,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:27:16,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:27:16,756 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:27:16,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:19,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:27:19,635 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:27:19,635 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:19,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/78161301a/548bb75c826d4039afe58557b844b86e/FLAG4beee603c [2023-11-29 01:27:19,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/78161301a/548bb75c826d4039afe58557b844b86e [2023-11-29 01:27:19,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:27:19,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:27:19,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:19,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:27:19,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:27:19,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44272e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19, skipping insertion in model container [2023-11-29 01:27:19,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,688 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:27:19,829 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2023-11-29 01:27:19,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:19,850 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:27:19,871 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2023-11-29 01:27:19,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:19,892 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:27:19,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19 WrapperNode [2023-11-29 01:27:19,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:19,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:19,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:27:19,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:27:19,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,931 INFO L138 Inliner]: procedures = 18, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2023-11-29 01:27:19,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:19,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:27:19,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:27:19,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:27:19,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,959 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2023-11-29 01:27:19,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:27:19,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:27:19,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:27:19,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:27:19,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (1/1) ... [2023-11-29 01:27:19,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:20,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:20,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:27:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 01:27:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:27:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:27:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 01:27:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 01:27:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 01:27:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:27:20,121 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:27:20,123 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:27:20,284 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:27:20,307 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:27:20,308 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:27:20,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:20 BoogieIcfgContainer [2023-11-29 01:27:20,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:27:20,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:27:20,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:27:20,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:27:20,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:27:19" (1/3) ... [2023-11-29 01:27:20,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4ee2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:20, skipping insertion in model container [2023-11-29 01:27:20,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:19" (2/3) ... [2023-11-29 01:27:20,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4ee2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:20, skipping insertion in model container [2023-11-29 01:27:20,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:20" (3/3) ... [2023-11-29 01:27:20,317 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:20,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:27:20,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:27:20,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:27:20,378 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;@290bbe01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:27:20,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:27:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:20,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:20,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:20,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:27:20,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2023-11-29 01:27:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312090185] [2023-11-29 01:27:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:27:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312090185] [2023-11-29 01:27:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312090185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:20,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:27:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61006452] [2023-11-29 01:27:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:20,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:27:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:27:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:27:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:20,696 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:20,803 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2023-11-29 01:27:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:27:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:27:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:20,815 INFO L225 Difference]: With dead ends: 32 [2023-11-29 01:27:20,815 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 01:27:20,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:27:20,821 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:20,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:27:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 01:27:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 01:27:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 01:27:20,854 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2023-11-29 01:27:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:20,855 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 01:27:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-11-29 01:27:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:20,856 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:20,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:20,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:27:20,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:27:20,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:20,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2023-11-29 01:27:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:27:20,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376130559] [2023-11-29 01:27:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:27:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:20,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:27:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:27:20,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:27:20,921 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:27:20,923 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:27:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:27:20,929 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 01:27:20,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:27:20,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:27:20 BoogieIcfgContainer [2023-11-29 01:27:20,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:27:20,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:27:20,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:27:20,960 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:27:20,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:20" (3/4) ... [2023-11-29 01:27:20,962 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:27:20,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:27:20,965 INFO L158 Benchmark]: Toolchain (without parser) took 1308.22ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 103.4MB in the beginning and 127.3MB in the end (delta: -23.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:27:20,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.28ms. Allocated memory is still 140.5MB. Free memory was 103.0MB in the beginning and 91.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 89.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,967 INFO L158 Benchmark]: Boogie Preprocessor took 40.11ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,967 INFO L158 Benchmark]: RCFGBuilder took 335.48ms. Allocated memory is still 140.5MB. Free memory was 87.4MB in the beginning and 73.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,968 INFO L158 Benchmark]: TraceAbstraction took 647.59ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 72.7MB in the beginning and 128.3MB in the end (delta: -55.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:27:20,968 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 127.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:27:20,972 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.17ms. Allocated memory is still 140.5MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.28ms. Allocated memory is still 140.5MB. Free memory was 103.0MB in the beginning and 91.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 89.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.11ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.48ms. Allocated memory is still 140.5MB. Free memory was 87.4MB in the beginning and 73.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 647.59ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 72.7MB in the beginning and 128.3MB in the end (delta: -55.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 127.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 51]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_132; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_132=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_132=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L30] COND TRUE main__i < 5UL [L32] EXPR main__max[main__i] VAL [__return_132=0, __return_main=0] [L32] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_132=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_132=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_132=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__VERIFIER_assert__cond=0, __return_132=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 01:27:20,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:27:22,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:27:22,975 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:27:22,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:27:22,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:27:23,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:27:23,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:27:23,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:27:23,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:27:23,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:27:23,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:27:23,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:27:23,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:27:23,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:27:23,020 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:27:23,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:27:23,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:27:23,021 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:27:23,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:27:23,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:27:23,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:27:23,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:27:23,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:27:23,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:27:23,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:27:23,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:27:23,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:27:23,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:27:23,027 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:27:23,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:27:23,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:27:23,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:27:23,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:27:23,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:23,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:27:23,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:27:23,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:27:23,030 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:27:23,030 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:27:23,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:27:23,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:27:23,031 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:27:23,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:27:23,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:27:23,032 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:27:23,032 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 -> 3507c00d68b8e41390815967879286d70904cb2355267878593fbddaafb4b556 [2023-11-29 01:27:23,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:27:23,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:27:23,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:27:23,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:27:23,335 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:27:23,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:26,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:27:26,331 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:27:26,332 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:26,340 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/aa4c96d21/bf7954d766cf4f519b5096b79262ec21/FLAG5c5dd3873 [2023-11-29 01:27:26,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/data/aa4c96d21/bf7954d766cf4f519b5096b79262ec21 [2023-11-29 01:27:26,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:27:26,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:27:26,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:26,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:27:26,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:27:26,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5592e0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26, skipping insertion in model container [2023-11-29 01:27:26,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,422 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:27:26,590 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2023-11-29 01:27:26,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:26,614 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:27:26,637 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_950d0d7c-48f4-4bd6-8269-9afd52379a7e/sv-benchmarks/c/float-benchs/interpolation.c.v+nlh-reducer.c[1314,1327] [2023-11-29 01:27:26,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:27:26,660 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:27:26,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26 WrapperNode [2023-11-29 01:27:26,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:27:26,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:26,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:27:26,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:27:26,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,703 INFO L138 Inliner]: procedures = 19, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2023-11-29 01:27:26,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:27:26,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:27:26,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:27:26,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:27:26,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,734 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2023-11-29 01:27:26,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:27:26,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:27:26,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:27:26,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:27:26,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (1/1) ... [2023-11-29 01:27:26,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:27:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:27:26,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:27:26,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:27:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:27:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-29 01:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-29 01:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-29 01:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:27:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:27:26,909 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:27:26,911 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:27:31,624 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:27:31,656 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:27:31,656 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:27:31,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:31 BoogieIcfgContainer [2023-11-29 01:27:31,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:27:31,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:27:31,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:27:31,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:27:31,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:27:26" (1/3) ... [2023-11-29 01:27:31,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43eff988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:31, skipping insertion in model container [2023-11-29 01:27:31,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:27:26" (2/3) ... [2023-11-29 01:27:31,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43eff988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:27:31, skipping insertion in model container [2023-11-29 01:27:31,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:27:31" (3/3) ... [2023-11-29 01:27:31,682 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2023-11-29 01:27:31,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:27:31,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:27:31,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:27:31,750 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;@3a80336d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:27:31,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:27:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:31,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:31,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:31,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:27:31,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2023-11-29 01:27:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:27:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255409953] [2023-11-29 01:27:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:31,781 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 01:27:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:27:31,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:31,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:32,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:27:32,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:27:32,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:27:32,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:27:32,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255409953] [2023-11-29 01:27:32,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255409953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:27:32,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:27:32,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:27:32,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436358286] [2023-11-29 01:27:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:27:32,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:27:32,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:27:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:27:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:27:32,197 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:35,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:27:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:27:35,850 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2023-11-29 01:27:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:27:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:27:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:27:35,863 INFO L225 Difference]: With dead ends: 30 [2023-11-29 01:27:35,864 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 01:27:35,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:27:35,870 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:27:35,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 01:27:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 01:27:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 01:27:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-11-29 01:27:35,904 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2023-11-29 01:27:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:27:35,904 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-11-29 01:27:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:27:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-11-29 01:27:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:27:35,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:27:35,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:27:35,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:36,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:36,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:27:36,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:27:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2023-11-29 01:27:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:27:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977492317] [2023-11-29 01:27:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:27:36,109 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 01:27:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:27:36,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:36,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:27:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:27:36,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:27:36,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:27:37,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:27:37,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2023-11-29 01:27:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2023-11-29 01:28:16,901 WARN L293 SmtUtils]: Spent 16.93s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:28:29,087 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:28:37,293 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:28:45,494 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:28:51,192 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:28:57,308 WARN L293 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:29:01,362 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))) (_ +zero 11 53)))))) is different from false [2023-11-29 01:29:05,386 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))) (_ +zero 11 53)))))) is different from true [2023-11-29 01:29:20,180 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:29:28,244 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:29:33,397 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:29:38,489 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:29:42,535 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))) (_ +zero 11 53)))))) is different from false [2023-11-29 01:29:46,561 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1))) (_ +zero 11 53)))))) is different from true [2023-11-29 01:29:58,794 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:05,759 WARN L293 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:11,466 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:16,971 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:29,192 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:37,409 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:44,021 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:50,156 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:30:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:50,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:30:50,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:30:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977492317] [2023-11-29 01:30:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977492317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:30:50,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:30:50,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:30:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70980877] [2023-11-29 01:30:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:30:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:30:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:30:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:30:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=52, Unknown=4, NotChecked=30, Total=110 [2023-11-29 01:30:50,162 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:54,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:30:56,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:30:58,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:30:59,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:31:02,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:31:56,375 WARN L293 SmtUtils]: Spent 45.04s on a formula simplification. DAG size of input: 73 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:32:00,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:02,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:05,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:13,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:17,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:21,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:25,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse6 (let ((.cse12 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse5 (let ((.cse11 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse4) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.sub roundNearestTiesToEven .cse3 .cse4))) (_ +zero 11 53)))))) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) .cse2)) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse6) (= .cse7 .cse6) (= .cse5 .cse8) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse9) (= .cse7 .cse9) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse9 .cse10))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse10) (= .cse8 .cse10)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 01:32:28,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:30,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:34,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:38,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:42,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:46,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:48,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:32:52,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:57,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:32:58,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:01,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:06,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:07,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:11,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:14,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:16,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:33:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:33:16,379 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-11-29 01:33:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:33:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:33:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:33:16,382 INFO L225 Difference]: With dead ends: 34 [2023-11-29 01:33:16,382 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 01:33:16,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 107.5s TimeCoverageRelationStatistics Valid=32, Invalid=65, Unknown=5, NotChecked=54, Total=156 [2023-11-29 01:33:16,383 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 88.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:33:16,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 11 Unknown, 94 Unchecked, 88.2s Time] [2023-11-29 01:33:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 01:33:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2023-11-29 01:33:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-29 01:33:16,388 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2023-11-29 01:33:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:33:16,388 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-29 01:33:16,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:33:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-29 01:33:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:33:16,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:33:16,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:33:16,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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)] Forceful destruction successful, exit code 0 [2023-11-29 01:33:16,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:33:16,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:33:16,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:33:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1695003617, now seen corresponding path program 1 times [2023-11-29 01:33:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:33:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329424633] [2023-11-29 01:33:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:33:16,593 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 01:33:16,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:33:16,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:33:16,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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)] Waiting until timeout for monitored process [2023-11-29 01:33:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:33:17,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 01:33:17,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:33:19,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:33:19,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2023-11-29 01:33:20,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2023-11-29 01:34:06,675 WARN L293 SmtUtils]: Spent 17.28s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:34:12,450 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:34:18,062 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:34:28,885 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~main__z~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:34:41,299 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:34:47,110 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:34:56,023 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:01,458 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:07,376 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:11,434 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2))))) is different from false [2023-11-29 01:35:15,470 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2))))) is different from true [2023-11-29 01:35:27,732 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:34,639 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:42,784 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:50,997 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:35:59,221 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:11,494 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:19,190 WARN L293 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:27,327 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:35,548 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:43,764 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:36:56,017 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:37:01,332 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:37:09,472 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:37:15,418 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:37:23,630 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:37:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:37:23,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:37:23,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:37:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329424633] [2023-11-29 01:37:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329424633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:37:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:37:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:37:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935612164] [2023-11-29 01:37:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:37:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:37:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:37:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:37:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=53, Unknown=3, NotChecked=30, Total=110 [2023-11-29 01:37:23,634 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:37:28,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:37:30,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:37:33,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:38:24,278 WARN L293 SmtUtils]: Spent 41.88s on a formula simplification. DAG size of input: 73 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:38:28,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:16,949 WARN L293 SmtUtils]: Spent 1.56m on a formula simplification. DAG size of input: 76 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:40:18,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:21,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:25,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:29,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:33,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:37,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:42,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse4 (let ((.cse13 (select .cse1 (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse3 (let ((.cse12 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 (_ bv16 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= .cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (= .cse5 .cse4) (= .cse3 .cse6) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse9) (fp.sub roundNearestTiesToEven .cse7 .cse9))))) (and (= .cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (not (fp.leq .cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq .cse8 (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse7) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse9))))) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse6 .cse10) (= .cse11 .cse5) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse10) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse11) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse10) (fp.sub c_currentRoundingMode .cse11 .cse10)) |c_ULTIMATE.start_main_~main__z~0#1|)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 01:40:46,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:50,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:51,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:40:53,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:40:58,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:41:02,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:41:08,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:41:11,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:41:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:41:11,039 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-11-29 01:41:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:41:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 01:41:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:41:11,041 INFO L225 Difference]: With dead ends: 29 [2023-11-29 01:41:11,041 INFO L226 Difference]: Without dead ends: 21 [2023-11-29 01:41:11,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 211.9s TimeCoverageRelationStatistics Valid=39, Invalid=78, Unknown=5, NotChecked=60, Total=182 [2023-11-29 01:41:11,043 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 64.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:41:11,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 36 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 8 Unknown, 83 Unchecked, 64.4s Time] [2023-11-29 01:41:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-29 01:41:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-29 01:41:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 01:41:11,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-11-29 01:41:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:41:11,048 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 01:41:11,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 01:41:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:41:11,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:41:11,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:41:11,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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)] Ended with exit code 0 [2023-11-29 01:41:11,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:41:11,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:41:11,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:41:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2047020067, now seen corresponding path program 1 times [2023-11-29 01:41:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:41:11,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913440317] [2023-11-29 01:41:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:11,251 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 01:41:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:41:11,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:41:11,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950d0d7c-48f4-4bd6-8269-9afd52379a7e/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 01:41:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:11,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:41:11,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:41:15,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:41:15,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 107 [2023-11-29 01:41:15,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 42 [2023-11-29 01:41:53,729 WARN L293 SmtUtils]: Spent 15.92s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:42:02,878 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 19 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:42:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:42:02,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:42:02,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913440317] [2023-11-29 01:42:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913440317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:42:02,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:42:02,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:42:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396142142] [2023-11-29 01:42:02,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:42:02,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:42:02,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:42:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:42:02,881 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:42:03,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:42:05,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:42:06,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:42:08,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:42:12,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]