./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i --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_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:39:08,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:39:08,953 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:39:08,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:39:08,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:39:08,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:39:08,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:39:08,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:39:08,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:39:08,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:39:08,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:39:08,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:39:08,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:39:08,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:39:08,989 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:39:08,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:39:08,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:39:08,991 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:39:08,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:39:08,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:39:08,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:39:08,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:39:08,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:39:08,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:39:08,994 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:39:08,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:39:08,995 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:39:08,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:39:08,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:39:08,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:39:08,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:39:08,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:39:08,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:39:08,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:39:08,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:39:08,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:39:08,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:39:08,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:39:08,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:39:08,999 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:39:08,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:39:09,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:39:09,000 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2023-11-29 06:39:09,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:39:09,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:39:09,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:39:09,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:39:09,227 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:39:09,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:11,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:39:12,189 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:39:12,190 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:12,199 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/bf955e2f0/dda931db7b3f480fbfb31be22f425c15/FLAG32bd69404 [2023-11-29 06:39:12,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/bf955e2f0/dda931db7b3f480fbfb31be22f425c15 [2023-11-29 06:39:12,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:39:12,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:39:12,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:39:12,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:39:12,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:39:12,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278a7bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12, skipping insertion in model container [2023-11-29 06:39:12,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,256 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:39:12,398 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2023-11-29 06:39:12,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:39:12,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:39:12,493 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2023-11-29 06:39:12,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:39:12,554 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:39:12,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12 WrapperNode [2023-11-29 06:39:12,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:39:12,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:39:12,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:39:12,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:39:12,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,622 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2023-11-29 06:39:12,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:39:12,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:39:12,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:39:12,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:39:12,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,659 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2023-11-29 06:39:12,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:39:12,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:39:12,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:39:12,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:39:12,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (1/1) ... [2023-11-29 06:39:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:39:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:39:12,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:39:12,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:39:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:39:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:39:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:39:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:39:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:39:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:39:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-29 06:39:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-29 06:39:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 06:39:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:39:12,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:39:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:39:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:39:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:39:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:39:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 06:39:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:39:12,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:39:12,915 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:39:12,917 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:39:13,337 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:39:13,395 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:39:13,395 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:39:13,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:13 BoogieIcfgContainer [2023-11-29 06:39:13,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:39:13,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:39:13,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:39:13,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:39:13,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:39:12" (1/3) ... [2023-11-29 06:39:13,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46be3e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:13, skipping insertion in model container [2023-11-29 06:39:13,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:12" (2/3) ... [2023-11-29 06:39:13,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46be3e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:13, skipping insertion in model container [2023-11-29 06:39:13,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:13" (3/3) ... [2023-11-29 06:39:13,403 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:13,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:39:13,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:39:13,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:39:13,466 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;@4f478434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:39:13,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:39:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:13,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:13,486 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:13,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:13,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash -941541902, now seen corresponding path program 1 times [2023-11-29 06:39:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607962977] [2023-11-29 06:39:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607962977] [2023-11-29 06:39:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607962977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253595700] [2023-11-29 06:39:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:39:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:13,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:39:13,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:39:13,924 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:13,968 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2023-11-29 06:39:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:39:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-29 06:39:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:13,978 INFO L225 Difference]: With dead ends: 219 [2023-11-29 06:39:13,978 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 06:39:13,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:39:13,984 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:13,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 06:39:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 06:39:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2023-11-29 06:39:14,031 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2023-11-29 06:39:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:14,031 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2023-11-29 06:39:14,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2023-11-29 06:39:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:14,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:14,036 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:39:14,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:14,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 245893272, now seen corresponding path program 1 times [2023-11-29 06:39:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381214716] [2023-11-29 06:39:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381214716] [2023-11-29 06:39:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381214716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577645325] [2023-11-29 06:39:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:14,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:14,412 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:14,477 INFO L93 Difference]: Finished difference Result 223 states and 326 transitions. [2023-11-29 06:39:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-29 06:39:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:14,480 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:39:14,480 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 06:39:14,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 06:39:14,483 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:14,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 454 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 06:39:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2023-11-29 06:39:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-11-29 06:39:14,503 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2023-11-29 06:39:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:14,503 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-11-29 06:39:14,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-11-29 06:39:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:14,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:14,508 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:14,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:39:14,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:14,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -139969130, now seen corresponding path program 1 times [2023-11-29 06:39:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849184296] [2023-11-29 06:39:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849184296] [2023-11-29 06:39:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849184296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796323610] [2023-11-29 06:39:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:14,771 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:14,819 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2023-11-29 06:39:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:14,822 INFO L225 Difference]: With dead ends: 233 [2023-11-29 06:39:14,822 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 06:39:14,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 06:39:14,825 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 21 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:14,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 06:39:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2023-11-29 06:39:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2023-11-29 06:39:14,840 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 163 [2023-11-29 06:39:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:14,841 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2023-11-29 06:39:14,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2023-11-29 06:39:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:14,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:14,844 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:14,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:39:14,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:14,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash -949315756, now seen corresponding path program 1 times [2023-11-29 06:39:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871306353] [2023-11-29 06:39:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:14,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871306353] [2023-11-29 06:39:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871306353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146030171] [2023-11-29 06:39:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:15,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:15,053 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:15,095 INFO L93 Difference]: Finished difference Result 233 states and 336 transitions. [2023-11-29 06:39:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:15,097 INFO L225 Difference]: With dead ends: 233 [2023-11-29 06:39:15,098 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 06:39:15,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 06:39:15,100 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 12 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:15,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 454 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 06:39:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-11-29 06:39:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2023-11-29 06:39:15,112 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 163 [2023-11-29 06:39:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:15,112 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2023-11-29 06:39:15,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2023-11-29 06:39:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:15,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:15,115 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:15,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:39:15,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:15,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -892057454, now seen corresponding path program 1 times [2023-11-29 06:39:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963122699] [2023-11-29 06:39:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963122699] [2023-11-29 06:39:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963122699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:15,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:15,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093719370] [2023-11-29 06:39:15,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:15,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:15,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:15,341 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:15,378 INFO L93 Difference]: Finished difference Result 233 states and 334 transitions. [2023-11-29 06:39:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:15,380 INFO L225 Difference]: With dead ends: 233 [2023-11-29 06:39:15,380 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 06:39:15,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 06:39:15,382 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:15,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 06:39:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-11-29 06:39:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2023-11-29 06:39:15,392 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 163 [2023-11-29 06:39:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:15,393 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2023-11-29 06:39:15,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2023-11-29 06:39:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:15,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:15,395 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:15,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:39:15,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:15,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -891997872, now seen corresponding path program 1 times [2023-11-29 06:39:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280055414] [2023-11-29 06:39:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:39:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:39:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 06:39:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:39:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:39:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:39:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 06:39:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 06:39:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:39:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:39:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:39:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:39:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:39:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:39:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:39:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:39:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:39:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:39:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:39:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:39:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:39:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:39:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280055414] [2023-11-29 06:39:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280055414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:16,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:39:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003412718] [2023-11-29 06:39:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:16,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:39:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:39:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:39:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:39:16,861 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 5 states, 3 states have (on average 20.333333333333332) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:39:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:16,967 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2023-11-29 06:39:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.333333333333332) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 163 [2023-11-29 06:39:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:16,970 INFO L225 Difference]: With dead ends: 233 [2023-11-29 06:39:16,970 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 06:39:16,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:39:16,971 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:16,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:39:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 06:39:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 06:39:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2023-11-29 06:39:16,981 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2023-11-29 06:39:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:16,982 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2023-11-29 06:39:16,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.333333333333332) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:39:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2023-11-29 06:39:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:16,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:16,984 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:39:16,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:16,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1408824718, now seen corresponding path program 1 times [2023-11-29 06:39:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:39:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998804465] [2023-11-29 06:39:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:39:17,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:39:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:39:17,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:39:17,274 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:39:17,275 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:39:17,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:39:17,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:17,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:39:17,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-29 06:39:17,338 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-29 06:39:17,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 06:39:17,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-29 06:39:17,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 06:39:17,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated [2023-11-29 06:39:17,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 06:39:17,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-29 06:39:17,340 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-29 06:39:17,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-29 06:39:17,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-29 06:39:17,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated [2023-11-29 06:39:17,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 06:39:17,341 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated [2023-11-29 06:39:17,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-29 06:39:17,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated [2023-11-29 06:39:17,343 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated [2023-11-29 06:39:17,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-29 06:39:17,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-29 06:39:17,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 06:39:17,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-29 06:39:17,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 06:39:17,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 06:39:17,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated [2023-11-29 06:39:17,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-29 06:39:17,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated [2023-11-29 06:39:17,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 06:39:17,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated [2023-11-29 06:39:17,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated [2023-11-29 06:39:17,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-29 06:39:17,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-29 06:39:17,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-29 06:39:17,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 06:39:17,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-11-29 06:39:17,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-11-29 06:39:17,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-29 06:39:17,348 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 06:39:17,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 06:39:17,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-29 06:39:17,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-11-29 06:39:17,349 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-11-29 06:39:17,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 06:39:17,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-29 06:39:17,350 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 06:39:17,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-11-29 06:39:17,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 06:39:17,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-11-29 06:39:17,351 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-29 06:39:17,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 06:39:17,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated [2023-11-29 06:39:17,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated [2023-11-29 06:39:17,352 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-29 06:39:17,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated [2023-11-29 06:39:17,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated [2023-11-29 06:39:17,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated [2023-11-29 06:39:17,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated [2023-11-29 06:39:17,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated [2023-11-29 06:39:17,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated [2023-11-29 06:39:17,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 06:39:17,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:39:17,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-29 06:39:17,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-29 06:39:17,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:39:17,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated [2023-11-29 06:39:17,362 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated [2023-11-29 06:39:17,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-29 06:39:17,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,364 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated [2023-11-29 06:39:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 06:39:17,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short142 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated [2023-11-29 06:39:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated [2023-11-29 06:39:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated [2023-11-29 06:39:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated [2023-11-29 06:39:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated [2023-11-29 06:39:17,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:39:17 BoogieIcfgContainer [2023-11-29 06:39:17,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:39:17,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:39:17,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:39:17,392 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:39:17,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:13" (3/4) ... [2023-11-29 06:39:17,395 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:39:17,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:39:17,396 INFO L158 Benchmark]: Toolchain (without parser) took 5178.33ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 132.1MB in the beginning and 109.2MB in the end (delta: 22.9MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,397 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:39:17,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.69ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 115.7MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.76ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 111.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,398 INFO L158 Benchmark]: Boogie Preprocessor took 81.36ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 105.6MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,398 INFO L158 Benchmark]: RCFGBuilder took 690.38ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 141.7MB in the end (delta: -36.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,398 INFO L158 Benchmark]: TraceAbstraction took 3993.80ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 140.9MB in the beginning and 109.2MB in the end (delta: 31.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2023-11-29 06:39:17,399 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 243.3MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:39:17,401 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.69ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 115.7MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.76ms. Allocated memory is still 176.2MB. Free memory was 115.7MB in the beginning and 111.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.36ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 105.6MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.38ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 141.7MB in the end (delta: -36.4MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3993.80ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 140.9MB in the beginning and 109.2MB in the end (delta: 31.7MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 243.3MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem75 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem78 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem79 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem93 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short140 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short142 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short134 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short124 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem107 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 2519 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1601 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 918 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1141 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 1012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5040/5040 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 06:39:17,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:39:19,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:39:19,479 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 06:39:19,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:39:19,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:39:19,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:39:19,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:39:19,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:39:19,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:39:19,513 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:39:19,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:39:19,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:39:19,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:39:19,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:39:19,516 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:39:19,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:39:19,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:39:19,517 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:39:19,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:39:19,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:39:19,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:39:19,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:39:19,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:39:19,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:39:19,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:39:19,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:39:19,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:39:19,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:39:19,523 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:39:19,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:39:19,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:39:19,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:39:19,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:39:19,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:39:19,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:39:19,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:39:19,527 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:39:19,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:39:19,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:39:19,527 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:39:19,527 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2023-11-29 06:39:19,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:39:19,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:39:19,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:39:19,838 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:39:19,838 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:39:19,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:22,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:39:22,767 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:39:22,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:22,795 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/77b7c5545/c92bc5c0466c4222811c80b58873b608/FLAGf1268c1b3 [2023-11-29 06:39:22,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/data/77b7c5545/c92bc5c0466c4222811c80b58873b608 [2023-11-29 06:39:22,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:39:22,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:39:22,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:39:22,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:39:22,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:39:22,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:22" (1/1) ... [2023-11-29 06:39:22,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd48907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:22, skipping insertion in model container [2023-11-29 06:39:22,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:39:22" (1/1) ... [2023-11-29 06:39:22,844 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:39:22,962 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2023-11-29 06:39:23,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:39:23,050 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:39:23,060 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_d8991ae1-c99a-4401-a7db-4f7db696ff60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2023-11-29 06:39:23,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:39:23,133 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:39:23,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23 WrapperNode [2023-11-29 06:39:23,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:39:23,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:39:23,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:39:23,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:39:23,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,197 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2023-11-29 06:39:23,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:39:23,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:39:23,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:39:23,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:39:23,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,241 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2023-11-29 06:39:23,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:39:23,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:39:23,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:39:23,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:39:23,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (1/1) ... [2023-11-29 06:39:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:39:23,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:39:23,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:39:23,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:39:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:39:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:39:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:39:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:39:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:39:23,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 06:39:23,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-29 06:39:23,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:39:23,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:39:23,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:39:23,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:39:23,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:39:23,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-29 06:39:23,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 06:39:23,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 06:39:23,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 06:39:23,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 06:39:23,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-29 06:39:23,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-11-29 06:39:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-29 06:39:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-29 06:39:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-29 06:39:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-11-29 06:39:23,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-11-29 06:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-11-29 06:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:39:23,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-11-29 06:39:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-11-29 06:39:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:39:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:39:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:39:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:39:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 06:39:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 06:39:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-29 06:39:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:39:23,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 06:39:23,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-11-29 06:39:23,541 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:39:23,543 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:39:25,131 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:39:25,195 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:39:25,195 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:39:25,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:25 BoogieIcfgContainer [2023-11-29 06:39:25,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:39:25,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:39:25,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:39:25,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:39:25,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:39:22" (1/3) ... [2023-11-29 06:39:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570a9ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:25, skipping insertion in model container [2023-11-29 06:39:25,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:39:23" (2/3) ... [2023-11-29 06:39:25,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570a9ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:25, skipping insertion in model container [2023-11-29 06:39:25,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:25" (3/3) ... [2023-11-29 06:39:25,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2023-11-29 06:39:25,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:39:25,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:39:25,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:39:25,279 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;@47eb5df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:39:25,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:39:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:25,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:25,301 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:25,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:25,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -941541902, now seen corresponding path program 1 times [2023-11-29 06:39:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345012371] [2023-11-29 06:39:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:25,323 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 06:39:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:25,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:25,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:25,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:39:25,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2023-11-29 06:39:25,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:25,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345012371] [2023-11-29 06:39:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345012371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:25,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873935633] [2023-11-29 06:39:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:39:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:39:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:39:25,821 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:25,871 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2023-11-29 06:39:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:39:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-29 06:39:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:25,881 INFO L225 Difference]: With dead ends: 219 [2023-11-29 06:39:25,881 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 06:39:25,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:39:25,887 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:25,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:39:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 06:39:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 06:39:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2023-11-29 06:39:25,931 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2023-11-29 06:39:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:25,932 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2023-11-29 06:39:25,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2023-11-29 06:39:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:25,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:25,937 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:25,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:26,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash 245893272, now seen corresponding path program 1 times [2023-11-29 06:39:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708572303] [2023-11-29 06:39:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:26,144 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 06:39:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:26,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:26,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:26,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-11-29 06:39:26,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:26,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:26,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708572303] [2023-11-29 06:39:26,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708572303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:26,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:26,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797664322] [2023-11-29 06:39:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:26,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:26,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:26,645 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:26,737 INFO L93 Difference]: Finished difference Result 223 states and 326 transitions. [2023-11-29 06:39:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:39:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-29 06:39:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:26,739 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:39:26,740 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 06:39:26,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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 06:39:26,743 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:26,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:39:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 06:39:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2023-11-29 06:39:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-11-29 06:39:26,760 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2023-11-29 06:39:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:26,761 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-11-29 06:39:26,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-11-29 06:39:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:26,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:26,765 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:26,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:26,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash -139969130, now seen corresponding path program 1 times [2023-11-29 06:39:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:26,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539840715] [2023-11-29 06:39:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:26,970 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 06:39:26,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:26,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:26,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:27,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:39:27,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:28,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 48 [2023-11-29 06:39:28,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:39:28,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2023-11-29 06:39:28,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:39:28,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-11-29 06:39:28,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:39:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2023-11-29 06:39:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-11-29 06:39:28,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-29 06:39:28,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:28,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539840715] [2023-11-29 06:39:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539840715] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:39:28,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:28,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 06:39:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618527136] [2023-11-29 06:39:28,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:28,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:39:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:39:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:39:28,719 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:39:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:29,800 INFO L93 Difference]: Finished difference Result 347 states and 495 transitions. [2023-11-29 06:39:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:39:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 163 [2023-11-29 06:39:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:29,804 INFO L225 Difference]: With dead ends: 347 [2023-11-29 06:39:29,805 INFO L226 Difference]: Without dead ends: 237 [2023-11-29 06:39:29,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:39:29,807 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 329 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:29,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 934 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:39:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-29 06:39:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2023-11-29 06:39:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2023-11-29 06:39:29,830 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2023-11-29 06:39:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:29,831 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2023-11-29 06:39:29,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:39:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2023-11-29 06:39:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:29,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:29,835 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:29,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:30,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2134113836, now seen corresponding path program 1 times [2023-11-29 06:39:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903388288] [2023-11-29 06:39:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:30,043 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 06:39:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:30,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:30,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:39:30,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:30,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:30,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903388288] [2023-11-29 06:39:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903388288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:30,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:39:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990631671] [2023-11-29 06:39:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:30,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:39:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:39:30,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:39:30,403 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:30,494 INFO L93 Difference]: Finished difference Result 254 states and 361 transitions. [2023-11-29 06:39:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:39:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:30,498 INFO L225 Difference]: With dead ends: 254 [2023-11-29 06:39:30,498 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 06:39:30,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 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 06:39:30,500 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:30,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 598 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:39:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 06:39:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2023-11-29 06:39:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2023-11-29 06:39:30,517 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 163 [2023-11-29 06:39:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:30,518 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2023-11-29 06:39:30,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2023-11-29 06:39:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:30,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:30,521 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:30,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:39:30,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:30,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1351506834, now seen corresponding path program 1 times [2023-11-29 06:39:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181862912] [2023-11-29 06:39:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:30,723 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 06:39:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:30,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:30,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:39:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:31,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:39:31,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:31,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:31,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:31,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181862912] [2023-11-29 06:39:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181862912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:39:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821127075] [2023-11-29 06:39:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:31,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:39:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:39:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:39:31,073 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:31,188 INFO L93 Difference]: Finished difference Result 261 states and 366 transitions. [2023-11-29 06:39:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:39:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:31,190 INFO L225 Difference]: With dead ends: 261 [2023-11-29 06:39:31,191 INFO L226 Difference]: Without dead ends: 141 [2023-11-29 06:39:31,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:39:31,192 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 49 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:31,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 741 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:39:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-29 06:39:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2023-11-29 06:39:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2023-11-29 06:39:31,206 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 163 [2023-11-29 06:39:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:31,206 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2023-11-29 06:39:31,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2023-11-29 06:39:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:31,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:31,209 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:31,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:39:31,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:31,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:31,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1408765136, now seen corresponding path program 1 times [2023-11-29 06:39:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765156455] [2023-11-29 06:39:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:31,414 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 06:39:31,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:31,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (7)] Waiting until timeout for monitored process [2023-11-29 06:39:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:31,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:39:31,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:39:31,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:31,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765156455] [2023-11-29 06:39:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765156455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:39:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844544632] [2023-11-29 06:39:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:31,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:39:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:39:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:39:31,770 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:31,948 INFO L93 Difference]: Finished difference Result 264 states and 366 transitions. [2023-11-29 06:39:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:39:31,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-29 06:39:31,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:31,951 INFO L225 Difference]: With dead ends: 264 [2023-11-29 06:39:31,951 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 06:39:31,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:39:31,952 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:31,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 878 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:39:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 06:39:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2023-11-29 06:39:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2023-11-29 06:39:31,964 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 163 [2023-11-29 06:39:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:31,965 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2023-11-29 06:39:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:39:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2023-11-29 06:39:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 06:39:31,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:31,967 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:31,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (7)] Ended with exit code 0 [2023-11-29 06:39:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:32,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:32,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:32,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1408824718, now seen corresponding path program 1 times [2023-11-29 06:39:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316668382] [2023-11-29 06:39:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:32,170 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 06:39:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:32,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:32,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (8)] Waiting until timeout for monitored process [2023-11-29 06:39:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:32,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:39:32,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:32,550 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 95 treesize of output 41 [2023-11-29 06:39:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-11-29 06:39:32,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:32,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316668382] [2023-11-29 06:39:32,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316668382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:32,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:39:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281237991] [2023-11-29 06:39:32,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:32,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:39:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:39:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:39:32,593 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:34,068 INFO L93 Difference]: Finished difference Result 255 states and 356 transitions. [2023-11-29 06:39:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:39:34,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-29 06:39:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:34,070 INFO L225 Difference]: With dead ends: 255 [2023-11-29 06:39:34,070 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 06:39:34,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:39:34,071 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 154 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:34,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 466 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 06:39:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 06:39:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2023-11-29 06:39:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2023-11-29 06:39:34,081 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 163 [2023-11-29 06:39:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:34,082 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2023-11-29 06:39:34,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2023-11-29 06:39:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 06:39:34,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:34,084 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:34,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (8)] Ended with exit code 0 [2023-11-29 06:39:34,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:34,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:34,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1033891128, now seen corresponding path program 1 times [2023-11-29 06:39:34,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987757358] [2023-11-29 06:39:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:34,285 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 06:39:34,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:34,286 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:34,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (9)] Waiting until timeout for monitored process [2023-11-29 06:39:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:34,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:39:34,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:34,666 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 95 treesize of output 41 [2023-11-29 06:39:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2023-11-29 06:39:34,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:34,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:34,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987757358] [2023-11-29 06:39:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987757358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:39:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066741338] [2023-11-29 06:39:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:34,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:39:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:39:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:39:34,697 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:35,948 INFO L93 Difference]: Finished difference Result 255 states and 354 transitions. [2023-11-29 06:39:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:39:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2023-11-29 06:39:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:35,950 INFO L225 Difference]: With dead ends: 255 [2023-11-29 06:39:35,950 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 06:39:35,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:39:35,952 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 144 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:35,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 464 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 06:39:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 06:39:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2023-11-29 06:39:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 06:39:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2023-11-29 06:39:35,964 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 165 [2023-11-29 06:39:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:35,964 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2023-11-29 06:39:35,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 06:39:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2023-11-29 06:39:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-29 06:39:35,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:35,966 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:35,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (9)] Ended with exit code 0 [2023-11-29 06:39:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:36,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:36,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1545903154, now seen corresponding path program 1 times [2023-11-29 06:39:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149732481] [2023-11-29 06:39:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:36,168 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 06:39:36,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:36,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:36,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (10)] Waiting until timeout for monitored process [2023-11-29 06:39:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:36,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 06:39:36,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:36,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:39:36,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:36,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:37,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:37,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 65 [2023-11-29 06:39:37,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:39:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2023-11-29 06:39:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-11-29 06:39:38,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:38,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149732481] [2023-11-29 06:39:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149732481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:39:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [126504221] [2023-11-29 06:39:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:39:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:39:38,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:39:38,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-11-29 06:39:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:40,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 06:39:40,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:40,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:39:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:40,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:40,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:41,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-11-29 06:39:42,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:39:42,050 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 176 treesize of output 80 [2023-11-29 06:39:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-11-29 06:39:42,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [126504221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:39:42,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-11-29 06:39:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446714939] [2023-11-29 06:39:42,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:42,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:39:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:39:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:39:42,164 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2023-11-29 06:39:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:46,933 INFO L93 Difference]: Finished difference Result 395 states and 543 transitions. [2023-11-29 06:39:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:39:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 167 [2023-11-29 06:39:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:46,936 INFO L225 Difference]: With dead ends: 395 [2023-11-29 06:39:46,936 INFO L226 Difference]: Without dead ends: 271 [2023-11-29 06:39:46,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:39:46,938 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 410 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:46,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1773 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 06:39:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-29 06:39:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 202. [2023-11-29 06:39:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 158 states have internal predecessors, (203), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:39:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2023-11-29 06:39:46,963 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 167 [2023-11-29 06:39:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:46,964 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2023-11-29 06:39:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2023-11-29 06:39:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2023-11-29 06:39:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-29 06:39:46,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:46,966 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:46,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-11-29 06:39:47,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (10)] Ended with exit code 0 [2023-11-29 06:39:47,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:47,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:47,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1104267222, now seen corresponding path program 1 times [2023-11-29 06:39:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996177104] [2023-11-29 06:39:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:47,368 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 06:39:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:47,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:47,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (12)] Waiting until timeout for monitored process [2023-11-29 06:39:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:47,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 06:39:47,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:47,786 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 79 treesize of output 43 [2023-11-29 06:39:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:39:47,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:48,037 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 49 treesize of output 25 [2023-11-29 06:39:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-29 06:39:48,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996177104] [2023-11-29 06:39:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996177104] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:39:48,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-11-29 06:39:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849985162] [2023-11-29 06:39:48,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:48,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:39:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:39:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:39:48,048 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:39:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:50,261 INFO L93 Difference]: Finished difference Result 418 states and 582 transitions. [2023-11-29 06:39:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:39:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 169 [2023-11-29 06:39:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:50,263 INFO L225 Difference]: With dead ends: 418 [2023-11-29 06:39:50,263 INFO L226 Difference]: Without dead ends: 206 [2023-11-29 06:39:50,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:39:50,264 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 149 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 884 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 06:39:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-29 06:39:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2023-11-29 06:39:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 156 states have internal predecessors, (199), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:39:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2023-11-29 06:39:50,285 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 169 [2023-11-29 06:39:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:50,285 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2023-11-29 06:39:50,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:39:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2023-11-29 06:39:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-29 06:39:50,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:50,287 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:50,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (12)] Ended with exit code 0 [2023-11-29 06:39:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:50,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:39:50,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 701148627, now seen corresponding path program 1 times [2023-11-29 06:39:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244992655] [2023-11-29 06:39:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:50,489 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 06:39:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:50,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:39:50,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (13)] Waiting until timeout for monitored process [2023-11-29 06:39:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:51,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 06:39:51,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:51,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:39:51,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:51,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:51,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:51,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2023-11-29 06:39:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 65 [2023-11-29 06:39:52,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:39:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2023-11-29 06:39:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-11-29 06:39:52,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:52,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244992655] [2023-11-29 06:39:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244992655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:39:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2001287636] [2023-11-29 06:39:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:52,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:39:52,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:39:52,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:39:52,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-11-29 06:39:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:54,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 06:39:54,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:39:55,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:55,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:55,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:55,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:39:56,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2023-11-29 06:39:56,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:39:56,586 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 176 treesize of output 80 [2023-11-29 06:39:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2023-11-29 06:39:56,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:56,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2001287636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:39:56,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:56,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 06:39:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374562143] [2023-11-29 06:39:56,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:56,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:39:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:39:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:39:56,708 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2023-11-29 06:40:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:00,849 INFO L93 Difference]: Finished difference Result 462 states and 637 transitions. [2023-11-29 06:40:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:40:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 169 [2023-11-29 06:40:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:00,852 INFO L225 Difference]: With dead ends: 462 [2023-11-29 06:40:00,852 INFO L226 Difference]: Without dead ends: 263 [2023-11-29 06:40:00,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=787, Unknown=0, NotChecked=0, Total=992 [2023-11-29 06:40:00,853 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 582 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:00,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1225 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 06:40:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-29 06:40:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 202. [2023-11-29 06:40:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 158 states have internal predecessors, (202), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:40:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 282 transitions. [2023-11-29 06:40:00,872 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 282 transitions. Word has length 169 [2023-11-29 06:40:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:00,873 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 282 transitions. [2023-11-29 06:40:00,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2023-11-29 06:40:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 282 transitions. [2023-11-29 06:40:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-29 06:40:00,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:00,875 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:00,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (13)] Ended with exit code 0 [2023-11-29 06:40:01,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-11-29 06:40:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:01,276 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:01,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2085186461, now seen corresponding path program 1 times [2023-11-29 06:40:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337474050] [2023-11-29 06:40:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:01,277 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 06:40:01,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:01,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:01,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (15)] Waiting until timeout for monitored process [2023-11-29 06:40:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:01,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:40:01,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:40:01,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:40:01,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337474050] [2023-11-29 06:40:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337474050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:01,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:40:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223795532] [2023-11-29 06:40:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:01,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:40:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:01,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:40:01,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:40:01,605 INFO L87 Difference]: Start difference. First operand 202 states and 282 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:01,686 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2023-11-29 06:40:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:40:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2023-11-29 06:40:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:01,688 INFO L225 Difference]: With dead ends: 419 [2023-11-29 06:40:01,688 INFO L226 Difference]: Without dead ends: 218 [2023-11-29 06:40:01,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:40:01,689 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 41 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:01,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 575 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:40:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-29 06:40:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2023-11-29 06:40:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 161 states have internal predecessors, (205), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:40:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 285 transitions. [2023-11-29 06:40:01,702 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 285 transitions. Word has length 169 [2023-11-29 06:40:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:01,703 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 285 transitions. [2023-11-29 06:40:01,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 285 transitions. [2023-11-29 06:40:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-29 06:40:01,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:01,704 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:01,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (15)] Forceful destruction successful, exit code 0 [2023-11-29 06:40:01,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:01,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:01,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1421228460, now seen corresponding path program 1 times [2023-11-29 06:40:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932690143] [2023-11-29 06:40:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:01,906 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 06:40:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:01,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:01,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (16)] Waiting until timeout for monitored process [2023-11-29 06:40:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:02,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 06:40:02,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:02,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:02,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:02,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:02,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 63 [2023-11-29 06:40:03,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:03,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2023-11-29 06:40:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:40:03,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:03,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932690143] [2023-11-29 06:40:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932690143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [727105516] [2023-11-29 06:40:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:03,690 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:40:03,691 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:40:03,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-11-29 06:40:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:05,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 06:40:05,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:05,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:06,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:06,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:06,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:06,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:07,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-11-29 06:40:07,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:07,685 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 174 treesize of output 78 [2023-11-29 06:40:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:40:07,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [727105516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:07,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:40:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-11-29 06:40:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219175907] [2023-11-29 06:40:07,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:40:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 06:40:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 06:40:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-11-29 06:40:07,790 INFO L87 Difference]: Start difference. First operand 205 states and 285 transitions. Second operand has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 06:40:13,982 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 [] [2023-11-29 06:40:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:18,091 INFO L93 Difference]: Finished difference Result 495 states and 671 transitions. [2023-11-29 06:40:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 06:40:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 169 [2023-11-29 06:40:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:18,094 INFO L225 Difference]: With dead ends: 495 [2023-11-29 06:40:18,094 INFO L226 Difference]: Without dead ends: 291 [2023-11-29 06:40:18,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 355 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=363, Invalid=1443, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 06:40:18,097 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 521 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:18,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1318 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1277 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 06:40:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-29 06:40:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 209. [2023-11-29 06:40:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:40:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2023-11-29 06:40:18,119 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 169 [2023-11-29 06:40:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:18,120 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2023-11-29 06:40:18,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 06:40:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2023-11-29 06:40:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:18,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:18,122 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:18,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (16)] Ended with exit code 0 [2023-11-29 06:40:18,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-11-29 06:40:18,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:18,523 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:18,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -590840400, now seen corresponding path program 1 times [2023-11-29 06:40:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915499744] [2023-11-29 06:40:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:18,524 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 06:40:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:18,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:18,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (18)] Waiting until timeout for monitored process [2023-11-29 06:40:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:18,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:40:18,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:18,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:40:18,960 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 40 treesize of output 22 [2023-11-29 06:40:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:40:18,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:40:18,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915499744] [2023-11-29 06:40:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915499744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:18,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:40:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763994450] [2023-11-29 06:40:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:18,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:40:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:40:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:40:18,982 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:19,341 INFO L93 Difference]: Finished difference Result 362 states and 502 transitions. [2023-11-29 06:40:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:40:19,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-11-29 06:40:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:19,344 INFO L225 Difference]: With dead ends: 362 [2023-11-29 06:40:19,344 INFO L226 Difference]: Without dead ends: 360 [2023-11-29 06:40:19,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:40:19,345 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 128 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:19,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 777 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:40:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-11-29 06:40:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 211. [2023-11-29 06:40:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 06:40:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 290 transitions. [2023-11-29 06:40:19,365 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 290 transitions. Word has length 171 [2023-11-29 06:40:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:19,365 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 290 transitions. [2023-11-29 06:40:19,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 290 transitions. [2023-11-29 06:40:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:19,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:19,367 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:19,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (18)] Ended with exit code 0 [2023-11-29 06:40:19,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:19,568 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:19,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash -590780818, now seen corresponding path program 1 times [2023-11-29 06:40:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:19,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115256501] [2023-11-29 06:40:19,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:19,569 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 06:40:19,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:19,570 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:19,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (19)] Waiting until timeout for monitored process [2023-11-29 06:40:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:20,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 06:40:20,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:40:20,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:40:20,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:40:20,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2023-11-29 06:40:20,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2023-11-29 06:40:20,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-11-29 06:40:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-11-29 06:40:20,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:40:20,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:20,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115256501] [2023-11-29 06:40:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115256501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:40:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617694759] [2023-11-29 06:40:20,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:20,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:40:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:40:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:40:20,751 INFO L87 Difference]: Start difference. First operand 211 states and 290 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:40:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:21,522 INFO L93 Difference]: Finished difference Result 531 states and 730 transitions. [2023-11-29 06:40:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:40:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 171 [2023-11-29 06:40:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:21,526 INFO L225 Difference]: With dead ends: 531 [2023-11-29 06:40:21,526 INFO L226 Difference]: Without dead ends: 321 [2023-11-29 06:40:21,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:40:21,528 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 305 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 627 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:40:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-29 06:40:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2023-11-29 06:40:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 246 states have (on average 1.2601626016260163) internal successors, (310), 248 states have internal predecessors, (310), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 06:40:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2023-11-29 06:40:21,567 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 438 transitions. Word has length 171 [2023-11-29 06:40:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:21,568 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 438 transitions. [2023-11-29 06:40:21,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-29 06:40:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 438 transitions. [2023-11-29 06:40:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:21,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:21,569 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:21,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (19)] Ended with exit code 0 [2023-11-29 06:40:21,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:21,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:21,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -533522516, now seen corresponding path program 1 times [2023-11-29 06:40:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902936029] [2023-11-29 06:40:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:21,771 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 06:40:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:21,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:21,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (20)] Waiting until timeout for monitored process [2023-11-29 06:40:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:22,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 06:40:22,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:22,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:40:22,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2023-11-29 06:40:22,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:22,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-11-29 06:40:22,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:22,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2023-11-29 06:40:22,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:40:23,096 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 48 treesize of output 36 [2023-11-29 06:40:23,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:23,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 40 [2023-11-29 06:40:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-11-29 06:40:23,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:40:23,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902936029] [2023-11-29 06:40:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902936029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:40:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642798729] [2023-11-29 06:40:23,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:23,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:40:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:40:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:40:23,135 INFO L87 Difference]: Start difference. First operand 319 states and 438 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:40:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:24,034 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2023-11-29 06:40:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:40:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 171 [2023-11-29 06:40:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:24,037 INFO L225 Difference]: With dead ends: 555 [2023-11-29 06:40:24,037 INFO L226 Difference]: Without dead ends: 337 [2023-11-29 06:40:24,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:40:24,038 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 399 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:24,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 639 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:40:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-29 06:40:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2023-11-29 06:40:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 256 states have (on average 1.24609375) internal successors, (319), 258 states have internal predecessors, (319), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 06:40:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2023-11-29 06:40:24,085 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 171 [2023-11-29 06:40:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:24,085 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2023-11-29 06:40:24,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-29 06:40:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2023-11-29 06:40:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:24,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:24,087 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:24,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (20)] Forceful destruction successful, exit code 0 [2023-11-29 06:40:24,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:24,287 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:24,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:24,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1342869142, now seen corresponding path program 1 times [2023-11-29 06:40:24,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:24,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096572543] [2023-11-29 06:40:24,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:24,289 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 06:40:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:24,289 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:24,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (21)] Waiting until timeout for monitored process [2023-11-29 06:40:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:24,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:40:24,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:24,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:40:25,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 24 [2023-11-29 06:40:25,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:25,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2023-11-29 06:40:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-11-29 06:40:25,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:40:25,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096572543] [2023-11-29 06:40:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096572543] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:25,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:40:25,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2023-11-29 06:40:25,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705882026] [2023-11-29 06:40:25,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:40:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:40:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:40:25,523 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:25,776 INFO L93 Difference]: Finished difference Result 622 states and 828 transitions. [2023-11-29 06:40:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:40:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-11-29 06:40:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:25,781 INFO L225 Difference]: With dead ends: 622 [2023-11-29 06:40:25,781 INFO L226 Difference]: Without dead ends: 396 [2023-11-29 06:40:25,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:40:25,782 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 55 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:25,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 742 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:40:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-11-29 06:40:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 368. [2023-11-29 06:40:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 291 states have internal predecessors, (363), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 06:40:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 499 transitions. [2023-11-29 06:40:25,855 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 499 transitions. Word has length 171 [2023-11-29 06:40:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:25,855 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 499 transitions. [2023-11-29 06:40:25,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 499 transitions. [2023-11-29 06:40:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:25,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:25,858 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:25,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (21)] Ended with exit code 0 [2023-11-29 06:40:26,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:26,058 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:26,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2043933720, now seen corresponding path program 1 times [2023-11-29 06:40:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77464841] [2023-11-29 06:40:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:26,059 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 06:40:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:26,060 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:26,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (22)] Waiting until timeout for monitored process [2023-11-29 06:40:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:26,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:40:26,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:26,408 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 19 treesize of output 13 [2023-11-29 06:40:26,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 06:40:26,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:26,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2023-11-29 06:40:26,676 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 38 treesize of output 26 [2023-11-29 06:40:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:40:26,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:40:26,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:26,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77464841] [2023-11-29 06:40:26,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77464841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:26,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:26,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:40:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554407376] [2023-11-29 06:40:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:26,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:40:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:40:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:40:26,757 INFO L87 Difference]: Start difference. First operand 368 states and 499 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:28,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:40:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:28,655 INFO L93 Difference]: Finished difference Result 598 states and 799 transitions. [2023-11-29 06:40:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:40:28,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-11-29 06:40:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:28,658 INFO L225 Difference]: With dead ends: 598 [2023-11-29 06:40:28,658 INFO L226 Difference]: Without dead ends: 339 [2023-11-29 06:40:28,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:40:28,659 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 101 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:28,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 647 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:40:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-29 06:40:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-11-29 06:40:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 260 states have internal predecessors, (317), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 06:40:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 453 transitions. [2023-11-29 06:40:28,706 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 453 transitions. Word has length 171 [2023-11-29 06:40:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:28,707 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 453 transitions. [2023-11-29 06:40:28,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 453 transitions. [2023-11-29 06:40:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:40:28,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:28,708 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:28,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (22)] Ended with exit code 0 [2023-11-29 06:40:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:28,909 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:28,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 254445273, now seen corresponding path program 1 times [2023-11-29 06:40:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778648363] [2023-11-29 06:40:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:28,910 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 06:40:28,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:28,911 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:28,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (23)] Waiting until timeout for monitored process [2023-11-29 06:40:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:29,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 06:40:29,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:29,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:29,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:29,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:29,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:30,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 63 [2023-11-29 06:40:30,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2023-11-29 06:40:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:40:31,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:31,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778648363] [2023-11-29 06:40:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778648363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2035066458] [2023-11-29 06:40:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:40:31,243 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:40:31,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 06:40:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:33,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 06:40:33,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:34,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:35,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2023-11-29 06:40:37,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:37,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 79 [2023-11-29 06:40:38,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:38,284 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 131 treesize of output 59 [2023-11-29 06:40:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 360 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2023-11-29 06:40:38,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-29 06:40:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2035066458] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:40:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 13] total 29 [2023-11-29 06:40:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31016072] [2023-11-29 06:40:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:39,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:40:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:39,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:40:39,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 06:40:39,178 INFO L87 Difference]: Start difference. First operand 339 states and 453 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:41,036 INFO L93 Difference]: Finished difference Result 716 states and 920 transitions. [2023-11-29 06:40:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:40:41,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2023-11-29 06:40:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:41,040 INFO L225 Difference]: With dead ends: 716 [2023-11-29 06:40:41,040 INFO L226 Difference]: Without dead ends: 486 [2023-11-29 06:40:41,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 06:40:41,041 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 120 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:41,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 534 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 06:40:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-29 06:40:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 444. [2023-11-29 06:40:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 349 states have (on average 1.2120343839541547) internal successors, (423), 353 states have internal predecessors, (423), 76 states have call successors, (76), 18 states have call predecessors, (76), 18 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-29 06:40:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 575 transitions. [2023-11-29 06:40:41,136 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 575 transitions. Word has length 171 [2023-11-29 06:40:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:41,136 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 575 transitions. [2023-11-29 06:40:41,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 06:40:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 575 transitions. [2023-11-29 06:40:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-29 06:40:41,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:41,139 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:41,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 06:40:41,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (23)] Forceful destruction successful, exit code 0 [2023-11-29 06:40:41,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:41,540 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:41,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1452782346, now seen corresponding path program 1 times [2023-11-29 06:40:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832901399] [2023-11-29 06:40:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:41,541 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 06:40:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:41,542 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:40:41,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (25)] Waiting until timeout for monitored process [2023-11-29 06:40:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:42,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 06:40:42,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:42,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:42,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:42,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:42,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:42,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 30 [2023-11-29 06:40:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 111 treesize of output 63 [2023-11-29 06:40:43,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:43,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2023-11-29 06:40:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:40:43,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:43,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832901399] [2023-11-29 06:40:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832901399] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1747851362] [2023-11-29 06:40:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:43,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:43,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:40:43,820 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:40:43,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 06:40:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:46,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 06:40:46,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:46,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:40:47,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:47,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:48,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:48,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2023-11-29 06:40:49,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2023-11-29 06:40:49,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:40:49,248 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 174 treesize of output 78 [2023-11-29 06:40:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2023-11-29 06:40:49,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1747851362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:49,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:40:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2023-11-29 06:40:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427029998] [2023-11-29 06:40:49,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:40:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 06:40:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 06:40:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:40:49,375 INFO L87 Difference]: Start difference. First operand 444 states and 575 transitions. Second operand has 25 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 06:40:54,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:40:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:59,543 INFO L93 Difference]: Finished difference Result 901 states and 1132 transitions. [2023-11-29 06:40:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 06:40:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 172 [2023-11-29 06:40:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:59,547 INFO L225 Difference]: With dead ends: 901 [2023-11-29 06:40:59,548 INFO L226 Difference]: Without dead ends: 574 [2023-11-29 06:40:59,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=445, Invalid=1907, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 06:40:59,550 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 828 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:59,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1636 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-29 06:40:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-11-29 06:40:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 356. [2023-11-29 06:40:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 288 states have (on average 1.2118055555555556) internal successors, (349), 293 states have internal predecessors, (349), 52 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-29 06:40:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 453 transitions. [2023-11-29 06:40:59,634 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 453 transitions. Word has length 172 [2023-11-29 06:40:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:59,635 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 453 transitions. [2023-11-29 06:40:59,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.0) internal successors, (138), 22 states have internal predecessors, (138), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 06:40:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 453 transitions. [2023-11-29 06:40:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 06:40:59,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:59,636 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:40:59,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-11-29 06:40:59,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (25)] Ended with exit code 0 [2023-11-29 06:41:00,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:41:00,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:41:00,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 426549496, now seen corresponding path program 1 times [2023-11-29 06:41:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065393429] [2023-11-29 06:41:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:00,038 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 06:41:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:00,039 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:41:00,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (27)] Waiting until timeout for monitored process [2023-11-29 06:41:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:00,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:41:00,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:00,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 24 [2023-11-29 06:41:00,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:41:00,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2023-11-29 06:41:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-11-29 06:41:00,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-29 06:41:01,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065393429] [2023-11-29 06:41:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065393429] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:41:01,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:41:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-11-29 06:41:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892046453] [2023-11-29 06:41:01,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:41:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:41:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:41:01,296 INFO L87 Difference]: Start difference. First operand 356 states and 453 transitions. Second operand has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:41:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:02,492 INFO L93 Difference]: Finished difference Result 630 states and 797 transitions. [2023-11-29 06:41:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:41:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 173 [2023-11-29 06:41:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:02,493 INFO L225 Difference]: With dead ends: 630 [2023-11-29 06:41:02,493 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:41:02,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:41:02,495 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 270 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:02,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 944 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:41:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:41:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:41:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 06:41:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:41:02,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2023-11-29 06:41:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:02,496 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:41:02,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.090909090909092) internal successors, (89), 13 states have internal predecessors, (89), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2023-11-29 06:41:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:41:02,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:41:02,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:41:02,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 (27)] Ended with exit code 0 [2023-11-29 06:41:02,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/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 06:41:02,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 06:41:26,089 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 06:41:26,089 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 06:41:26,089 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 06:41:26,089 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 06:41:26,090 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,090 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-29 06:41:26,090 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 06:41:26,090 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 06:41:26,090 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 06:41:26,091 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse5 (select |#memory_int#2| |~#float_Array_0~0.base|)) (.cse9 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse9 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (let ((.cse11 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (select .cse9 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse7 (= currentRoundingMode roundNearestTiesToEven)) (.cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse9 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse0)) .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 (not (fp.leq (let ((.cse4 (select .cse5 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 (_ bv16 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) .cse7 (fp.geq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) .cse8) (and (= (select .cse9 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8))) .cse1 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse10 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse10 .cse0) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse10)))))) .cse3 .cse7 .cse8 (= ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))) [2023-11-29 06:41:26,091 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-29 06:41:26,091 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,091 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-11-29 06:41:26,092 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse12 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse5 (select |#memory_int#2| |~#float_Array_0~0.base|)) (.cse10 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse10 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse2 (let ((.cse13 (select .cse5 (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (select .cse10 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse7 (= |ULTIMATE.start_updateVariables_#t~mem33#1| ((_ extract 7 0) (select .cse12 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse10 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse0)) .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 (not (fp.leq (let ((.cse4 (select .cse5 (_ bv8 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (select .cse5 (_ bv16 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) .cse7 .cse8 (fp.geq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) .cse9) (and (= (select .cse10 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8))) .cse1 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse10 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse11 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse11 .cse0) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse11)))))) .cse3 .cse7 .cse8 .cse9 (= ((_ extract 7 0) (select .cse12 |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))) [2023-11-29 06:41:26,092 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-29 06:41:26,092 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-11-29 06:41:26,092 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L72-2(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L72-3(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L72-5(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,093 INFO L899 garLoopResultBuilder]: For program point L72-7(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L895 garLoopResultBuilder]: At program point L72-8(line 72) the Hoare annotation is: (let ((.cse22 (select |#memory_int#2| |~#float_Array_0~0.base|))) (let ((.cse28 (let ((.cse36 (select .cse22 (_ bv0 32)))) (fp ((_ extract 31 31) .cse36) ((_ extract 30 23) .cse36) ((_ extract 22 0) .cse36)))) (.cse35 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse34 (fp.geq .cse28 .cse35)) (.cse24 (fp.leq .cse28 (fp.neg .cse35))) (.cse25 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse23 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (.cse30 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse29 (select .cse25 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse16 (not |ULTIMATE.start_updateVariables_#t~short41#1|)) (.cse7 (not |ULTIMATE.start_updateVariables_#t~short37#1|)) (.cse9 (not .cse24)) (.cse15 (not |ULTIMATE.start_updateVariables_#t~short40#1|)) (.cse33 (not .cse34))) (let ((.cse1 (or (and .cse15 .cse33) (and |ULTIMATE.start_updateVariables_#t~short40#1| .cse34))) (.cse12 (or (and |ULTIMATE.start_updateVariables_#t~short37#1| .cse24) (and .cse7 .cse9))) (.cse3 (or (and .cse33 .cse16) (and |ULTIMATE.start_updateVariables_#t~short41#1| .cse34))) (.cse5 (fp.leq .cse28 .cse32)) (.cse13 (fp.geq .cse28 (fp.neg .cse32))) (.cse17 (= (select .cse25 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8)))) (.cse18 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|)))))) (.cse19 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse31 .cse29) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse31))))))) (.cse20 (= ((_ extract 7 0) (select .cse30 |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse30 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse29))) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse25 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse14 (fp.geq .cse28 .cse23)) (.cse6 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse8 (not (fp.leq (let ((.cse26 (select .cse22 (_ bv8 32)))) (fp ((_ extract 31 31) .cse26) ((_ extract 30 23) .cse26) ((_ extract 22 0) .cse26))) (let ((.cse27 (select .cse22 (_ bv16 32)))) (fp ((_ extract 31 31) .cse27) ((_ extract 30 23) .cse27) ((_ extract 22 0) .cse27)))))) (.cse10 (= currentRoundingMode roundNearestTiesToEven)) (.cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse25 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (or (and .cse0 .cse12 .cse13 .cse6) (and .cse0 |ULTIMATE.start_updateVariables_#t~short37#1| .cse14 .cse6)) .cse15 .cse16 .cse10) (and .cse0 .cse17 .cse1 .cse12 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse6 .cse10 .cse11 .cse20) (and .cse0 .cse15 .cse16 .cse6 .cse7 .cse10 (not (fp.geq (let ((.cse21 (select .cse22 |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse21) ((_ extract 30 23) .cse21) ((_ extract 22 0) .cse21))) .cse23))) (and .cse0 .cse17 |ULTIMATE.start_updateVariables_#t~short37#1| |ULTIMATE.start_updateVariables_#t~short41#1| .cse4 .cse18 .cse14 .cse19 .cse6 .cse24 .cse10 .cse11 .cse20) (and .cse0 .cse2 |ULTIMATE.start_updateVariables_#t~short37#1| |ULTIMATE.start_updateVariables_#t~short41#1| .cse4 .cse14 .cse6 .cse24 .cse8 .cse10 .cse11))))))) [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L72-9(line 72) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 66) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L74-2(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 49) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L107-3(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L74-3(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,094 INFO L899 garLoopResultBuilder]: For program point L107-5(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L74-5(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-6(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-7(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L74-7(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-8(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L895 garLoopResultBuilder]: At program point L74-8(line 74) the Hoare annotation is: (let ((.cse23 (select |#memory_int#2| |~#float_Array_0~0.base|)) (.cse18 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse17 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse21 (select .cse18 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse5 (let ((.cse25 (select .cse23 (_ bv0 32)))) (fp ((_ extract 31 31) .cse25) ((_ extract 30 23) .cse25) ((_ extract 22 0) .cse25)))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse8 (fp.leq .cse5 (fp.neg .cse19))) (.cse13 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse21))) (.cse14 (not (fp.leq (let ((.cse22 (select .cse23 (_ bv8 32)))) (fp ((_ extract 31 31) .cse22) ((_ extract 30 23) .cse22) ((_ extract 22 0) .cse22))) (let ((.cse24 (select .cse23 (_ bv16 32)))) (fp ((_ extract 31 31) .cse24) ((_ extract 30 23) .cse24) ((_ extract 22 0) .cse24)))))) (.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse1 (= (select .cse18 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8)))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse18 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse18 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|)))))) (.cse15 (fp.leq .cse5 .cse6)) (.cse4 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse20 .cse21) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse20))))))) (.cse7 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse9 (= currentRoundingMode roundNearestTiesToEven)) (.cse16 (fp.geq .cse5 .cse19)) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse18 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|)))) (.cse11 (= ((_ extract 7 0) (select .cse17 |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (.cse12 (not |ULTIMATE.start_updateVariables_#t~short45#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (fp.geq .cse5 (fp.neg .cse6)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse2 (fp.geq .cse5 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse7 .cse8 .cse14 .cse9 .cse10 .cse12) (and .cse0 .cse13 .cse2 .cse15 .cse7 .cse14 .cse9 .cse16 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12))))) [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L74-9(line 74) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-10(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-12(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-13(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,095 INFO L899 garLoopResultBuilder]: For program point L107-15(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-17(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-18(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-19(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-21(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-23(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-24(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-26(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-27(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-29(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-30(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L107-32(line 107) no Hoare annotation was computed. [2023-11-29 06:41:26,096 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 65) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76-2(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76-3(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76-5(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76-7(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L895 garLoopResultBuilder]: At program point L76-8(line 76) the Hoare annotation is: (let ((.cse24 (select |#memory_int#2| |~#float_Array_0~0.base|)) (.cse17 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse16 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse21 (select .cse17 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse18 (let ((.cse26 (select .cse24 (_ bv0 32)))) (fp ((_ extract 31 31) .cse26) ((_ extract 30 23) .cse26) ((_ extract 22 0) .cse26)))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (let ((.cse4 (fp.geq .cse18 (fp.neg .cse22))) (.cse6 (fp.leq .cse18 (fp.neg .cse19))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse21))) (.cse7 (not (fp.leq (let ((.cse23 (select .cse24 (_ bv8 32)))) (fp ((_ extract 31 31) .cse23) ((_ extract 30 23) .cse23) ((_ extract 22 0) .cse23))) (let ((.cse25 (select .cse24 (_ bv16 32)))) (fp ((_ extract 31 31) .cse25) ((_ extract 30 23) .cse25) ((_ extract 22 0) .cse25)))))) (.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32))) (.cse10 (= (select .cse17 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8)))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse17 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse11 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|)))))) (.cse3 (not |ULTIMATE.start_updateVariables_#t~short53#1|)) (.cse14 (fp.leq .cse18 .cse22)) (.cse12 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse20 .cse21) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse20))))))) (.cse5 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse15 (fp.geq .cse18 .cse19)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse17 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|)))) (.cse13 (= ((_ extract 7 0) (select .cse16 |~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse5 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse15 .cse9) (and .cse0 .cse10 .cse2 .cse11 .cse3 .cse14 .cse12 .cse5 .cse8 .cse15 .cse9 .cse13))))) [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L76-9(line 76) no Hoare annotation was computed. [2023-11-29 06:41:26,097 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 64) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78-3(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78-5(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78-7(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L895 garLoopResultBuilder]: At program point L78-8(line 78) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L78-9(line 78) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 06:41:26,098 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L63-2(line 63) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L895 garLoopResultBuilder]: At program point L113-2(lines 113 119) the Hoare annotation is: (let ((.cse12 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse6 (select |#memory_int#2| |~#float_Array_0~0.base|)) (.cse10 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|)) (.cse11 ((_ extract 7 0) (select .cse12 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse0 (bvsle ((_ zero_extend 24) .cse11) (_ bv0 32))) (.cse2 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse10 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (let ((.cse14 (select .cse6 (_ bv0 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse1 (select .cse10 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))) (.cse4 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse10 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) .cse1)) .cse2 (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse4 (not (fp.leq (let ((.cse5 (select .cse6 (_ bv8 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse7 (select .cse6 (_ bv16 32)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) .cse8 (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) .cse9) (and .cse0 (= (select .cse10 (bvadd (_ bv6 32) |~#unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) (_ bv4 8))) (= ((_ sign_extend 24) .cse11) (select .cse12 |~#BOOL_unsigned_char_Array_0~0.offset|)) .cse2 (= (select (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) (select .cse10 (bvadd (_ bv7 32) |~#unsigned_char_Array_0~0.offset|))))) (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (let ((.cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|))) (and (= .cse13 .cse1) (= (select (select |#memory_int#5| |~#unsigned_long_int_Array_0~0.base|) |~#unsigned_long_int_Array_0~0.offset|) ((_ zero_extend 24) ((_ extract 7 0) .cse13)))))) .cse4 .cse8 .cse9))))) [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L113-3(lines 113 119) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L895 garLoopResultBuilder]: At program point L80-8(line 80) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,099 INFO L899 garLoopResultBuilder]: For program point L80-9(line 80) no Hoare annotation was computed. [2023-11-29 06:41:26,099 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,100 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-29 06:41:26,100 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,100 INFO L899 garLoopResultBuilder]: For program point L98-1(line 98) no Hoare annotation was computed. [2023-11-29 06:41:26,100 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 06:41:26,100 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,100 INFO L899 garLoopResultBuilder]: For program point L82-1(line 82) no Hoare annotation was computed. [2023-11-29 06:41:26,100 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,101 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-11-29 06:41:26,101 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,101 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-11-29 06:41:26,101 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|) (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (_ bv0 32)) (let ((.cse7 (select |#memory_int#4| |~#unsigned_char_Array_0~0.base|))) (let ((.cse0 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet86#1_39| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet86#1_39|) (select .cse7 (bvadd (_ bv2 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse1 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet92#1_38| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet92#1_38|) (select .cse7 (bvadd (_ bv8 32) |~#unsigned_char_Array_0~0.offset|))))) (.cse3 (= |~#float_Array_0~0.offset| (_ bv0 32))) (.cse2 (let ((.cse8 (select (select |#memory_int#2| |~#float_Array_0~0.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse4 (= currentRoundingMode roundNearestTiesToEven)) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet89#1_38| (_ BitVec 8))) (= (select .cse7 (bvadd |~#unsigned_char_Array_0~0.offset| (_ bv5 32))) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet89#1_38|))))) (or (and .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) .cse3 .cse4 (fp.geq .cse2 .cse5) .cse6) (and .cse0 .cse1 (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) .cse3 (fp.leq .cse2 (fp.neg .cse5)) .cse4 .cse6))))) [2023-11-29 06:41:26,101 INFO L899 garLoopResultBuilder]: For program point L101-1(line 101) no Hoare annotation was computed. [2023-11-29 06:41:26,104 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:41:26,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:41:26,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-11-29 06:41:26,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet86#1_39 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet86#1_39) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-11-29 06:41:26,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet92#1_38 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet92#1_38) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated [2023-11-29 06:41:26,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated [2023-11-29 06:41:26,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated [2023-11-29 06:41:26,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated [2023-11-29 06:41:26,123 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1188) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1044) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1168) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1044) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1096) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateBinaryExpression(CACSL2BoogieBacktranslator.java:1095) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpression(CACSL2BoogieBacktranslator.java:1034) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateExpressionWithContext(CACSL2BoogieBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-29 06:41:26,126 INFO L158 Benchmark]: Toolchain (without parser) took 123314.58ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 67.6MB in the beginning and 66.2MB in the end (delta: 1.5MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,126 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:41:26,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.11ms. Allocated memory is still 88.1MB. Free memory was 67.3MB in the beginning and 50.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 45.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,127 INFO L158 Benchmark]: Boogie Preprocessor took 104.43ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 45.9MB in the beginning and 108.6MB in the end (delta: -62.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,128 INFO L158 Benchmark]: RCFGBuilder took 1892.49ms. Allocated memory is still 132.1MB. Free memory was 108.0MB in the beginning and 105.1MB in the end (delta: 2.9MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,128 INFO L158 Benchmark]: TraceAbstraction took 120926.97ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 104.6MB in the beginning and 66.2MB in the end (delta: 38.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2023-11-29 06:41:26,129 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.25ms. Allocated memory is still 88.1MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.11ms. Allocated memory is still 88.1MB. Free memory was 67.3MB in the beginning and 50.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 45.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.43ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 45.9MB in the beginning and 108.6MB in the end (delta: -62.7MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1892.49ms. Allocated memory is still 132.1MB. Free memory was 108.0MB in the beginning and 105.1MB in the end (delta: 2.9MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * TraceAbstraction took 120926.97ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 104.6MB in the beginning and 66.2MB in the end (delta: 38.4MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet86#1_39 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet86#1_39) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet92#1_38 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet92#1_38) == #memory_int#4[~#unsigned_char_Array_0~0!base][~bvadd~32(8bv32, ~#unsigned_char_Array_0~0!offset)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#float_Array_0~0!base][0bv32] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 120.8s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 4706 SdHoareTripleChecker+Valid, 37.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4681 mSDsluCounter, 17014 SdHoareTripleChecker+Invalid, 34.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13634 mSDsCounter, 758 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7729 IncrementalHoareTripleChecker+Invalid, 8488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 758 mSolverCounterUnsat, 3380 mSDtfsCounter, 7729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5538 GetRequests, 5187 SyntacticMatches, 10 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=19, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 860 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 713 PreInvPairs, 776 NumberOfFragments, 5914 HoareAnnotationTreeSize, 713 FomulaSimplifications, 250771 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 23 FomulaSimplificationsInter, 161701 FormulaSimplificationTreeSizeReductionInter, 22.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 16.2s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 4368 NumberOfCodeBlocks, 4368 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5184 ConstructedInterpolants, 113 QuantifiedInterpolants, 90994 SizeOfPredicates, 231 NumberOfNonLiveVariables, 9404 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 23695/26040 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29): de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateFunctionApplication(CACSL2BoogieBacktranslator.java:1188) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 06:41:26,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8991ae1-c99a-4401-a7db-4f7db696ff60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression cannot be cast to class de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral (de.uni_freiburg.informatik.ultimate.boogie.ast.BitVectorAccessExpression and de.uni_freiburg.informatik.ultimate.boogie.ast.BitvecLiteral are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @619bfe29)