./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:04:59,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:04:59,945 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:04:59,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:04:59,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:04:59,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:04:59,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:04:59,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:04:59,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:04:59,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:04:59,997 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:04:59,997 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:04:59,998 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:04:59,998 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:04:59,998 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:04:59,999 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:04:59,999 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:04:59,999 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:05:00,002 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:05:00,003 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:05:00,003 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:05:00,004 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:05:00,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:05:00,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:05:00,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:05:00,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:05:00,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:05:00,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:05:00,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:05:00,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:05:00,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:05:00,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:05:00,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:05:00,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:05:00,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:05:00,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:05:00,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:05:00,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:05:00,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:00,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:05:00,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:05:00,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:05:00,016 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:05:00,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:05:00,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:05:00,018 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:05:00,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:05:00,018 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 [2024-11-09 05:05:00,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:05:00,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:05:00,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:05:00,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:05:00,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:05:00,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i Unable to find full path for "g++" [2024-11-09 05:05:02,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:05:02,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:05:02,561 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 05:05:02,575 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/3fc600eb3/bb1b6453b8064a5e9127f614796f839f/FLAG67602f608 [2024-11-09 05:05:02,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/3fc600eb3/bb1b6453b8064a5e9127f614796f839f [2024-11-09 05:05:02,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:05:02,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:05:02,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:02,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:05:02,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:05:02,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:02" (1/1) ... [2024-11-09 05:05:02,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2c3678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:02, skipping insertion in model container [2024-11-09 05:05:02,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:02" (1/1) ... [2024-11-09 05:05:02,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:05:03,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 05:05:03,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:03,298 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:05:03,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 05:05:03,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:03,427 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:05:03,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03 WrapperNode [2024-11-09 05:05:03,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:03,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:03,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:05:03,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:05:03,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,536 INFO L138 Inliner]: procedures = 29, calls = 233, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 771 [2024-11-09 05:05:03,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:03,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:05:03,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:05:03,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:05:03,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:05:03,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:05:03,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:05:03,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:05:03,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (1/1) ... [2024-11-09 05:05:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:03,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:05:03,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:05:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:05:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:05:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 05:05:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 05:05:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:05:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 05:05:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:05:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:05:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:05:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:05:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:05:03,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:05:03,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:05:04,826 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 05:05:04,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:05:05,756 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:05:05,758 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:05:05,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:05 BoogieIcfgContainer [2024-11-09 05:05:05,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:05:05,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:05:05,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:05:05,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:05:05,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:05:02" (1/3) ... [2024-11-09 05:05:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bc562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:05, skipping insertion in model container [2024-11-09 05:05:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:03" (2/3) ... [2024-11-09 05:05:05,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bc562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:05, skipping insertion in model container [2024-11-09 05:05:05,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:05" (3/3) ... [2024-11-09 05:05:05,772 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 05:05:05,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:05:05,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:05:05,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:05:05,871 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@6275d77c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:05:05,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:05:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 05:05:05,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:05,887 INFO L215 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:05,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash 429662635, now seen corresponding path program 1 times [2024-11-09 05:05:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206786504] [2024-11-09 05:05:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:05:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239782551] [2024-11-09 05:05:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:08,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:08,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:05:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:05:10,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:05:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:05:11,892 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:05:11,895 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:05:11,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 05:05:11,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:05:12,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 05:05:12,113 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 05:05:12,258 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:05:12,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:05:12 BoogieIcfgContainer [2024-11-09 05:05:12,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:05:12,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:05:12,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:05:12,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:05:12,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:05" (3/4) ... [2024-11-09 05:05:12,271 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:05:12,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:05:12,274 INFO L158 Benchmark]: Toolchain (without parser) took 9335.67ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 142.4MB in the beginning and 169.1MB in the end (delta: -26.8MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,274 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:05:12,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.71ms. Allocated memory is still 182.5MB. Free memory was 142.4MB in the beginning and 122.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.21ms. Allocated memory is still 182.5MB. Free memory was 122.0MB in the beginning and 116.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,277 INFO L158 Benchmark]: Boogie Preprocessor took 90.81ms. Allocated memory is still 182.5MB. Free memory was 116.6MB in the beginning and 111.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,278 INFO L158 Benchmark]: RCFGBuilder took 2130.60ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 75.3MB in the end (delta: 36.5MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,281 INFO L158 Benchmark]: TraceAbstraction took 6504.79ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 74.3MB in the beginning and 170.2MB in the end (delta: -95.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-11-09 05:05:12,281 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 310.4MB. Free memory was 170.2MB in the beginning and 169.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:05:12,287 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.30ms. Allocated memory is still 121.6MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.71ms. Allocated memory is still 182.5MB. Free memory was 142.4MB in the beginning and 122.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.21ms. Allocated memory is still 182.5MB. Free memory was 122.0MB in the beginning and 116.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.81ms. Allocated memory is still 182.5MB. Free memory was 116.6MB in the beginning and 111.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2130.60ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 75.3MB in the end (delta: 36.5MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6504.79ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 74.3MB in the beginning and 170.2MB in the end (delta: -95.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 310.4MB. Free memory was 170.2MB in the beginning and 169.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2][2][2] = { {{127.5, 5.5}, {99.84, 4.3}}, {{1.5, 1.8}, {25.8, 500.7}} }; [L28-L30] signed char signed_char_Array_0[3] = { 0, -64, 2 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { -1, 1, 256 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 4 }; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L67] EXPR double_Array_0[0][0][0] [L67] EXPR double_Array_0[0][0][0] >= 0.0F && double_Array_0[0][0][0] <= -1.0e-20F [L67] EXPR double_Array_0[0][0][0] [L67] EXPR double_Array_0[0][0][0] >= 0.0F && double_Array_0[0][0][0] <= -1.0e-20F [L67] EXPR (double_Array_0[0][0][0] >= 0.0F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not((double_Array_0[0][0][0] >= 0.0F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not((double_Array_0[0][0][0] >= 0.0F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[1][0][0] [L69] EXPR double_Array_0[1][0][0] >= 0.0F && double_Array_0[1][0][0] <= -1.0e-20F [L69] EXPR double_Array_0[1][0][0] [L69] EXPR double_Array_0[1][0][0] >= 0.0F && double_Array_0[1][0][0] <= -1.0e-20F [L69] EXPR (double_Array_0[1][0][0] >= 0.0F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 9223372.036854765600e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not((double_Array_0[1][0][0] >= 0.0F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 9223372.036854765600e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not((double_Array_0[1][0][0] >= 0.0F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 9223372.036854765600e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1][1][0] [L71] EXPR double_Array_0[1][1][0] >= -922337.2036854765600e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L71] EXPR double_Array_0[1][1][0] [L71] EXPR double_Array_0[1][1][0] >= -922337.2036854765600e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L71] EXPR (double_Array_0[1][1][0] >= -922337.2036854765600e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 9223372.036854765600e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -922337.2036854765600e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 9223372.036854765600e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not((double_Array_0[1][1][0] >= -922337.2036854765600e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 9223372.036854765600e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] double_Array_0[0][0][1] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[0][0][1] [L73] EXPR double_Array_0[0][0][1] >= -922337.2036854765600e+13F && double_Array_0[0][0][1] <= -1.0e-20F [L73] EXPR double_Array_0[0][0][1] [L73] EXPR double_Array_0[0][0][1] >= -922337.2036854765600e+13F && double_Array_0[0][0][1] <= -1.0e-20F [L73] EXPR (double_Array_0[0][0][1] >= -922337.2036854765600e+13F && double_Array_0[0][0][1] <= -1.0e-20F) || (double_Array_0[0][0][1] <= 9223372.036854765600e+12F && double_Array_0[0][0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not((double_Array_0[0][0][1] >= -922337.2036854765600e+13F && double_Array_0[0][0][1] <= -1.0e-20F) || (double_Array_0[0][0][1] <= 9223372.036854765600e+12F && double_Array_0[0][0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not((double_Array_0[0][0][1] >= -922337.2036854765600e+13F && double_Array_0[0][0][1] <= -1.0e-20F) || (double_Array_0[0][0][1] <= 9223372.036854765600e+12F && double_Array_0[0][0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[0][1][1] [L75] EXPR double_Array_0[0][1][1] >= -922337.2036854765600e+13F && double_Array_0[0][1][1] <= -1.0e-20F [L75] EXPR (double_Array_0[0][1][1] >= -922337.2036854765600e+13F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) [L75] EXPR double_Array_0[0][1][1] [L75] EXPR double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F [L75] EXPR double_Array_0[0][1][1] [L75] EXPR double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F [L75] EXPR (double_Array_0[0][1][1] >= -922337.2036854765600e+13F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not((double_Array_0[0][1][1] >= -922337.2036854765600e+13F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not((double_Array_0[0][1][1] >= -922337.2036854765600e+13F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] double_Array_0[1][1][1] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[1][1][1] [L77] EXPR double_Array_0[1][1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1][1] <= -1.0e-20F [L77] EXPR (double_Array_0[1][1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1][1] <= -1.0e-20F) || (double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F ) [L77] EXPR double_Array_0[1][1][1] [L77] EXPR double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F [L77] EXPR double_Array_0[1][1][1] [L77] EXPR double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F [L77] EXPR (double_Array_0[1][1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1][1] <= -1.0e-20F) || (double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not((double_Array_0[1][1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1][1] <= -1.0e-20F) || (double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not((double_Array_0[1][1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1][1] <= -1.0e-20F) || (double_Array_0[1][1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L43] EXPR double_Array_0[1][1][1] [L43] double_Array_0[0][1][0] = double_Array_0[1][1][1] [L44] EXPR signed_short_int_Array_0[1] [L44] unsigned_short_int_Array_0[0] = signed_short_int_Array_0[1] [L45] EXPR signed_char_Array_0[2] [L45] signed_char_Array_0[1] = signed_char_Array_0[2] [L46] EXPR unsigned_short_int_Array_0[0] [L46] EXPR signed_char_Array_0[1] [L46] unsigned char stepLocal_0 = unsigned_short_int_Array_0[0] <= signed_char_Array_0[1]; [L47] EXPR BOOL_unsigned_char_Array_0[0] [L47] COND TRUE BOOL_unsigned_char_Array_0[0] || stepLocal_0 [L48] EXPR signed_char_Array_0[2] [L48] EXPR ((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]) [L48] EXPR signed_char_Array_0[2] [L48] EXPR ((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]) [L48] signed_char_Array_0[0] = ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))) [L52] EXPR signed_short_int_Array_0[1] [L52] signed short int stepLocal_1 = signed_short_int_Array_0[1]; [L53] EXPR unsigned_short_int_Array_0[0] [L53] EXPR signed_long_int_Array_0[0] [L53] COND FALSE !(stepLocal_1 <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) [L56] EXPR double_Array_0[0][0][0] [L56] EXPR double_Array_0[1][0][0] [L56] double_Array_0[1][0][1] = (double_Array_0[0][0][0] - double_Array_0[1][0][0]) [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR signed_char_Array_0[0] [L58] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]) [L58] EXPR signed_char_Array_0[0] [L58] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]) [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR unsigned_short_int_Array_0[0] [L58] EXPR signed_char_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0])) [L58] EXPR signed_char_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0])) [L58] COND FALSE !((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR signed_char_Array_0[0] [L95] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]) [L95] EXPR signed_char_Array_0[0] [L95] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]) [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR signed_char_Array_0[1] [L95] EXPR signed_long_int_Array_0[0] [L95] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0])) [L95] EXPR signed_char_Array_0[1] [L95] EXPR signed_long_int_Array_0[0] [L95] EXPR (((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0])) [L95] EXPR ((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1 [L95] EXPR (((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2]))) [L95] EXPR BOOL_unsigned_char_Array_0[0] [L95] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1]) [L95] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])) [L95] EXPR signed_char_Array_0[0] [L95] EXPR signed_char_Array_0[2] [L95] EXPR ((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]) [L95] EXPR signed_char_Array_0[2] [L95] EXPR ((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]) [L95] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])) [L95] EXPR (((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2]))) [L95] EXPR ((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0])))) [L95] EXPR signed_short_int_Array_0[1] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR signed_long_int_Array_0[0] [L95] EXPR (signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))) [L95] EXPR double_Array_0[1][0][1] [L95] EXPR double_Array_0[0][0][0] [L95] EXPR double_Array_0[1][0][0] [L95] EXPR (signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))) [L95] EXPR ((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0])))) [L95] EXPR (((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))))) && (double_Array_0[0][1][0] == ((double) double_Array_0[1][1][1])) [L95] EXPR ((((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))))) && (double_Array_0[0][1][0] == ((double) double_Array_0[1][1][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[1])) [L95] EXPR (((((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))))) && (double_Array_0[0][1][0] == ((double) double_Array_0[1][1][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) [L95-L96] return (((((((((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) > (signed_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : (signed_char_Array_0[0]))) <= (((((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) < ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))) ? ((unsigned_short_int_Array_0[0] - unsigned_short_int_Array_0[0])) : ((signed_char_Array_0[1] % signed_long_int_Array_0[0]))))) ? (signed_short_int_Array_0[2] == ((signed short int) (((((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) < (signed_char_Array_0[0])) ? ((signed_short_int_Array_0[0] - signed_short_int_Array_0[1])) : (signed_char_Array_0[0]))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[0] <= signed_char_Array_0[1])) ? (signed_char_Array_0[0] == ((signed char) ((((1 - signed_char_Array_0[2]) < 0 ) ? -(1 - signed_char_Array_0[2]) : (1 - signed_char_Array_0[2]))))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[2])))) && ((signed_short_int_Array_0[1] <= (unsigned_short_int_Array_0[0] / signed_long_int_Array_0[0])) ? (double_Array_0[1][0][1] == ((double) ((((((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) < (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1]))))) ? (((((((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) > (double_Array_0[0][1][1])) ? (((((double_Array_0[1][1][0]) < (double_Array_0[0][0][1])) ? (double_Array_0[1][1][0]) : (double_Array_0[0][0][1])))) : (double_Array_0[0][1][1])))) : (((((3.6) > (double_Array_0[1][1][1])) ? (3.6) : (double_Array_0[1][1][1])))))))) : (double_Array_0[1][0][1] == ((double) (double_Array_0[0][0][0] - double_Array_0[1][0][0]))))) && (double_Array_0[0][1][0] == ((double) double_Array_0[1][1][1]))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_short_int_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 1, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 05:05:12,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:05:14,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:05:14,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 05:05:14,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:05:14,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:05:14,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:05:14,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:05:14,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:05:14,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:05:14,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:05:14,906 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:05:14,907 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:05:14,907 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:05:14,907 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:05:14,908 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:05:14,908 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:05:14,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:05:14,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:05:14,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:05:14,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:05:14,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:05:14,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:05:14,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:05:14,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:05:14,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:05:14,912 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:05:14,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:05:14,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:05:14,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:05:14,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:05:14,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:05:14,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:05:14,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:05:14,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:05:14,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:05:14,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:14,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:05:14,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:05:14,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:05:14,916 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:05:14,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:05:14,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:05:14,917 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:05:14,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 7435769e205a5a22a211f82999711a463f5dd426d6bac372f4ec13ff649b3c52 [2024-11-09 05:05:15,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:05:15,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:05:15,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:05:15,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:05:15,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:05:15,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i Unable to find full path for "g++" [2024-11-09 05:05:17,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:05:17,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:05:17,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 05:05:17,699 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/98661fac5/cf43e1dfaa8e4f0fa99ac2eb631605cd/FLAG060294096 [2024-11-09 05:05:17,724 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/data/98661fac5/cf43e1dfaa8e4f0fa99ac2eb631605cd [2024-11-09 05:05:17,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:05:17,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:05:17,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:17,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:05:17,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:05:17,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:17" (1/1) ... [2024-11-09 05:05:17,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8ae1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:17, skipping insertion in model container [2024-11-09 05:05:17,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:17" (1/1) ... [2024-11-09 05:05:17,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:05:17,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 05:05:18,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:18,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:05:18,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-80.i[916,929] [2024-11-09 05:05:18,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:18,323 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:05:18,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18 WrapperNode [2024-11-09 05:05:18,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:18,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:18,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:05:18,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:05:18,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,411 INFO L138 Inliner]: procedures = 36, calls = 233, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 767 [2024-11-09 05:05:18,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:18,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:05:18,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:05:18,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:05:18,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:05:18,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:05:18,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:05:18,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:05:18,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (1/1) ... [2024-11-09 05:05:18,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:18,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:05:18,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:05:18,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:05:18,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 05:05:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 05:05:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 05:05:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-09 05:05:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:05:18,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 05:05:18,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 05:05:18,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:05:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-09 05:05:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:05:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:05:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:05:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:05:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 05:05:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-09 05:05:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:05:18,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:05:18,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:05:21,140 INFO L? ?]: Removed 259 outVars from TransFormulas that were not future-live. [2024-11-09 05:05:21,140 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:05:21,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:05:21,162 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:05:21,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:21 BoogieIcfgContainer [2024-11-09 05:05:21,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:05:21,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:05:21,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:05:21,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:05:21,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:05:17" (1/3) ... [2024-11-09 05:05:21,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213f8271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:21, skipping insertion in model container [2024-11-09 05:05:21,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:18" (2/3) ... [2024-11-09 05:05:21,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213f8271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:21, skipping insertion in model container [2024-11-09 05:05:21,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:21" (3/3) ... [2024-11-09 05:05:21,173 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-80.i [2024-11-09 05:05:21,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:05:21,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:05:21,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:05:21,279 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@16d01ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:05:21,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:05:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 05:05:21,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:21,301 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:21,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:21,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1285127872, now seen corresponding path program 1 times [2024-11-09 05:05:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:21,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702979143] [2024-11-09 05:05:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:21,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:21,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:21,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 05:05:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:22,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 05:05:22,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-09 05:05:22,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:22,121 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702979143] [2024-11-09 05:05:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702979143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:05:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740556296] [2024-11-09 05:05:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:05:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:05:22,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:05:22,166 INFO L87 Difference]: Start difference. First operand has 154 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:22,223 INFO L93 Difference]: Finished difference Result 301 states and 469 transitions. [2024-11-09 05:05:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:05:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-09 05:05:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:22,240 INFO L225 Difference]: With dead ends: 301 [2024-11-09 05:05:22,240 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 05:05:22,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:05:22,250 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:22,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:05:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 05:05:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-09 05:05:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2024-11-09 05:05:22,316 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 153 [2024-11-09 05:05:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:22,317 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2024-11-09 05:05:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2024-11-09 05:05:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 05:05:22,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:22,324 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:22,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 05:05:22,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:22,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1579933014, now seen corresponding path program 1 times [2024-11-09 05:05:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:22,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891285842] [2024-11-09 05:05:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:22,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:22,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:22,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:22,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 05:05:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:23,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:05:23,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-09 05:05:23,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:23,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:23,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891285842] [2024-11-09 05:05:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891285842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:05:23,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194359961] [2024-11-09 05:05:23,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:23,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:05:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:05:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:23,396 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:23,541 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2024-11-09 05:05:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:05:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2024-11-09 05:05:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:23,545 INFO L225 Difference]: With dead ends: 299 [2024-11-09 05:05:23,546 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 05:05:23,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:23,548 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:23,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 05:05:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 05:05:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-09 05:05:23,562 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 153 [2024-11-09 05:05:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:23,564 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-09 05:05:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-09 05:05:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 05:05:23,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:23,571 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:23,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:05:23,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:23,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -541348440, now seen corresponding path program 1 times [2024-11-09 05:05:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204825115] [2024-11-09 05:05:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:23,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:23,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 05:05:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:24,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:05:24,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:24,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:24,542 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204825115] [2024-11-09 05:05:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204825115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:24,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:24,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:05:24,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902825662] [2024-11-09 05:05:24,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:24,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:05:24,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:05:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:24,547 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:24,628 INFO L93 Difference]: Finished difference Result 303 states and 448 transitions. [2024-11-09 05:05:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:05:24,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 153 [2024-11-09 05:05:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:24,631 INFO L225 Difference]: With dead ends: 303 [2024-11-09 05:05:24,632 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 05:05:24,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:24,634 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:24,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:05:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 05:05:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 05:05:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-09 05:05:24,660 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2024-11-09 05:05:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:24,662 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-09 05:05:24,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-09 05:05:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 05:05:24,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:24,667 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:24,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 05:05:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:24,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -351813373, now seen corresponding path program 1 times [2024-11-09 05:05:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782024646] [2024-11-09 05:05:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:24,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:24,874 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:24,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 05:05:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:25,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:05:25,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:25,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:25,642 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782024646] [2024-11-09 05:05:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782024646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:25,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:25,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:05:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702127676] [2024-11-09 05:05:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:25,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:05:25,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:05:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:05:25,649 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:25,753 INFO L93 Difference]: Finished difference Result 310 states and 456 transitions. [2024-11-09 05:05:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:05:25,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 05:05:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:25,756 INFO L225 Difference]: With dead ends: 310 [2024-11-09 05:05:25,756 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 05:05:25,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:05:25,758 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:25,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 852 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 05:05:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-09 05:05:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.410071942446043) internal successors, (196), 139 states have internal predecessors, (196), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-09 05:05:25,770 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 155 [2024-11-09 05:05:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:25,770 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-09 05:05:25,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-09 05:05:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 05:05:25,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:25,773 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:25,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:05:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:25,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 328244997, now seen corresponding path program 1 times [2024-11-09 05:05:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731702461] [2024-11-09 05:05:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:25,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:25,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:25,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:25,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 05:05:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:26,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:05:26,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:26,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:26,702 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731702461] [2024-11-09 05:05:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731702461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:26,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712606832] [2024-11-09 05:05:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:26,705 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:26,839 INFO L93 Difference]: Finished difference Result 316 states and 461 transitions. [2024-11-09 05:05:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 05:05:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:26,846 INFO L225 Difference]: With dead ends: 316 [2024-11-09 05:05:26,846 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 05:05:26,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:26,848 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:26,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1055 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 05:05:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-09 05:05:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-09 05:05:26,871 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 155 [2024-11-09 05:05:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:26,872 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-09 05:05:26,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-09 05:05:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 05:05:26,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:26,877 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:26,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 05:05:27,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:27,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2103252359, now seen corresponding path program 1 times [2024-11-09 05:05:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200428521] [2024-11-09 05:05:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:27,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:27,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 05:05:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:27,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:05:27,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:28,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:28,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:28,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200428521] [2024-11-09 05:05:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200428521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:28,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:28,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:05:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980453676] [2024-11-09 05:05:28,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:28,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:05:28,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:05:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:28,006 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:28,159 INFO L93 Difference]: Finished difference Result 320 states and 465 transitions. [2024-11-09 05:05:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:05:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 155 [2024-11-09 05:05:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:28,161 INFO L225 Difference]: With dead ends: 320 [2024-11-09 05:05:28,162 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 05:05:28,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:28,163 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:28,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1259 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 05:05:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-09 05:05:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3986013986013985) internal successors, (200), 143 states have internal predecessors, (200), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2024-11-09 05:05:28,173 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 155 [2024-11-09 05:05:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:28,173 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2024-11-09 05:05:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2024-11-09 05:05:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 05:05:28,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:28,176 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:28,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:28,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2105099401, now seen corresponding path program 1 times [2024-11-09 05:05:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918296467] [2024-11-09 05:05:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:28,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:28,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:29,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:05:29,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:29,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:05:29,420 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 155 treesize of output 65 [2024-11-09 05:05:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-09 05:05:29,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:29,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918296467] [2024-11-09 05:05:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918296467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:29,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:29,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:05:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510450648] [2024-11-09 05:05:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:29,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:29,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:29,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:29,530 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:31,786 INFO L93 Difference]: Finished difference Result 322 states and 466 transitions. [2024-11-09 05:05:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:05:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2024-11-09 05:05:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:31,789 INFO L225 Difference]: With dead ends: 322 [2024-11-09 05:05:31,789 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 05:05:31,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:05:31,791 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 207 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:31,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 616 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 05:05:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 05:05:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-09 05:05:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 143 states have internal predecessors, (199), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions. [2024-11-09 05:05:31,809 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 155 [2024-11-09 05:05:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:31,809 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 233 transitions. [2024-11-09 05:05:31,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2024-11-09 05:05:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 05:05:31,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:31,811 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:31,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:32,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:32,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2039897501, now seen corresponding path program 1 times [2024-11-09 05:05:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517394176] [2024-11-09 05:05:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:32,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:32,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:32,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:05:32,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:33,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:05:33,143 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 173 treesize of output 65 [2024-11-09 05:05:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-09 05:05:33,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:33,197 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:33,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517394176] [2024-11-09 05:05:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517394176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:33,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:05:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878895344] [2024-11-09 05:05:33,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:33,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:33,199 INFO L87 Difference]: Start difference. First operand 162 states and 233 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:35,325 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2024-11-09 05:05:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:05:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2024-11-09 05:05:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:35,327 INFO L225 Difference]: With dead ends: 322 [2024-11-09 05:05:35,327 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 05:05:35,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:05:35,328 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 199 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:35,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 612 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 05:05:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 05:05:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-09 05:05:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3846153846153846) internal successors, (198), 143 states have internal predecessors, (198), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 232 transitions. [2024-11-09 05:05:35,336 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 232 transitions. Word has length 157 [2024-11-09 05:05:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:35,336 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 232 transitions. [2024-11-09 05:05:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 05:05:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 232 transitions. [2024-11-09 05:05:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:05:35,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:35,339 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:35,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:35,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -978274169, now seen corresponding path program 1 times [2024-11-09 05:05:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12364569] [2024-11-09 05:05:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:35,546 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:35,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:36,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:05:36,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-09 05:05:36,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:36,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:36,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12364569] [2024-11-09 05:05:36,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12364569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:36,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:36,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235782777] [2024-11-09 05:05:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:36,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:36,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:36,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:36,260 INFO L87 Difference]: Start difference. First operand 162 states and 232 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 05:05:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:36,570 INFO L93 Difference]: Finished difference Result 325 states and 466 transitions. [2024-11-09 05:05:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:05:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 159 [2024-11-09 05:05:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:36,574 INFO L225 Difference]: With dead ends: 325 [2024-11-09 05:05:36,574 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 05:05:36,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:36,575 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 954 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:05:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 05:05:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-09 05:05:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 143 states have internal predecessors, (197), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2024-11-09 05:05:36,588 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 159 [2024-11-09 05:05:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:36,589 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2024-11-09 05:05:36,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 05:05:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2024-11-09 05:05:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:05:36,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:36,595 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:36,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:36,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:36,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:36,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash -393502519, now seen corresponding path program 1 times [2024-11-09 05:05:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881490181] [2024-11-09 05:05:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:36,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:36,798 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:36,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (11)] Waiting until timeout for monitored process [2024-11-09 05:05:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:37,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 05:05:37,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:38,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:05:38,408 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 67 treesize of output 71 [2024-11-09 05:05:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:39,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:39,144 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881490181] [2024-11-09 05:05:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881490181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:39,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232932255] [2024-11-09 05:05:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:39,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:39,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:39,146 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:50,496 INFO L93 Difference]: Finished difference Result 384 states and 547 transitions. [2024-11-09 05:05:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:05:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:50,500 INFO L225 Difference]: With dead ends: 384 [2024-11-09 05:05:50,500 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 05:05:50,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:50,501 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 70 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:50,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 652 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-09 05:05:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 05:05:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2024-11-09 05:05:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:05:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 241 transitions. [2024-11-09 05:05:50,510 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 241 transitions. Word has length 159 [2024-11-09 05:05:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:50,511 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 241 transitions. [2024-11-09 05:05:50,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:05:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 241 transitions. [2024-11-09 05:05:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:05:50,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:50,513 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:50,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (11)] Ended with exit code 0 [2024-11-09 05:05:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:50,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:05:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1907320071, now seen corresponding path program 1 times [2024-11-09 05:05:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:05:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416232080] [2024-11-09 05:05:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:50,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:05:50,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:05:50,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:05:50,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:05:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:51,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:05:51,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:52,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:05:52,901 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 69 treesize of output 73 [2024-11-09 05:05:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:05:53,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:05:53,637 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:05:53,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416232080] [2024-11-09 05:05:53,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416232080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:53,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:53,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:05:53,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296203053] [2024-11-09 05:05:53,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:53,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:05:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:05:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:05:53,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:53,639 INFO L87 Difference]: Start difference. First operand 169 states and 241 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:04,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:06:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:04,649 INFO L93 Difference]: Finished difference Result 394 states and 560 transitions. [2024-11-09 05:06:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:06:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:06:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:04,654 INFO L225 Difference]: With dead ends: 394 [2024-11-09 05:06:04,654 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 05:06:04,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:06:04,655 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 73 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:04,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 575 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2024-11-09 05:06:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 05:06:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 172. [2024-11-09 05:06:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.3725490196078431) internal successors, (210), 153 states have internal predecessors, (210), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:06:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 244 transitions. [2024-11-09 05:06:04,663 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 244 transitions. Word has length 159 [2024-11-09 05:06:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:04,664 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 244 transitions. [2024-11-09 05:06:04,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 244 transitions. [2024-11-09 05:06:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:06:04,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:04,666 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:06:04,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:04,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:06:04,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1089671621, now seen corresponding path program 1 times [2024-11-09 05:06:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:06:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493505971] [2024-11-09 05:06:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:06:04,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:06:04,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:05,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:06:05,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:06:07,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:06:07,356 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:06:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493505971] [2024-11-09 05:06:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493505971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:06:07,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:06:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:06:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402536869] [2024-11-09 05:06:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:06:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:06:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:06:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:06:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:06:07,358 INFO L87 Difference]: Start difference. First operand 172 states and 244 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:18,031 INFO L93 Difference]: Finished difference Result 388 states and 550 transitions. [2024-11-09 05:06:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:06:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:06:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:18,044 INFO L225 Difference]: With dead ends: 388 [2024-11-09 05:06:18,045 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 05:06:18,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:06:18,046 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 63 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:18,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 645 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-09 05:06:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 05:06:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 170. [2024-11-09 05:06:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 151 states have internal predecessors, (207), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:06:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2024-11-09 05:06:18,062 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 159 [2024-11-09 05:06:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:18,063 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2024-11-09 05:06:18,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2024-11-09 05:06:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:06:18,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:18,065 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:06:18,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:18,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:06:18,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1411935815, now seen corresponding path program 1 times [2024-11-09 05:06:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:06:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643041705] [2024-11-09 05:06:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:18,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:06:18,271 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:06:18,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:06:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:19,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:06:19,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:19,095 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 37 treesize of output 21 [2024-11-09 05:06:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:06:19,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:06:19,135 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:06:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643041705] [2024-11-09 05:06:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643041705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:06:19,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:06:19,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:06:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023471974] [2024-11-09 05:06:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:06:19,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:06:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:06:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:06:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:06:19,138 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:22,046 INFO L93 Difference]: Finished difference Result 338 states and 481 transitions. [2024-11-09 05:06:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:06:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:06:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:22,057 INFO L225 Difference]: With dead ends: 338 [2024-11-09 05:06:22,057 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 05:06:22,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:06:22,058 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:22,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 527 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 05:06:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 05:06:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-09 05:06:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.368421052631579) internal successors, (208), 152 states have internal predecessors, (208), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:06:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 242 transitions. [2024-11-09 05:06:22,067 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 242 transitions. Word has length 159 [2024-11-09 05:06:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:22,068 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 242 transitions. [2024-11-09 05:06:22,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 242 transitions. [2024-11-09 05:06:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:06:22,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:22,072 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:06:22,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:06:22,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:22,272 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:06:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -252953909, now seen corresponding path program 1 times [2024-11-09 05:06:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:06:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529345377] [2024-11-09 05:06:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:06:22,276 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:06:22,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:23,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 05:06:23,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:06:25,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:06:25,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:06:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529345377] [2024-11-09 05:06:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529345377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:06:25,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:06:25,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:06:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162010405] [2024-11-09 05:06:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:06:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:06:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:06:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:06:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:06:25,169 INFO L87 Difference]: Start difference. First operand 171 states and 242 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:37,085 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2024-11-09 05:06:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:06:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:06:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:37,092 INFO L225 Difference]: With dead ends: 399 [2024-11-09 05:06:37,092 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 05:06:37,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:06:37,093 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 71 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:37,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 588 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-09 05:06:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 05:06:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 174. [2024-11-09 05:06:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.367741935483871) internal successors, (212), 155 states have internal predecessors, (212), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:06:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2024-11-09 05:06:37,104 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 159 [2024-11-09 05:06:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:37,105 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2024-11-09 05:06:37,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:06:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2024-11-09 05:06:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:06:37,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:37,107 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:06:37,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:06:37,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:37,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:06:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1070602359, now seen corresponding path program 1 times [2024-11-09 05:06:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:06:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323031032] [2024-11-09 05:06:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:37,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:06:37,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:06:37,312 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:06:37,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:38,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 05:06:38,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:06:40,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:06:40,904 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:06:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323031032] [2024-11-09 05:06:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323031032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:06:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:06:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:06:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846107651] [2024-11-09 05:06:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:06:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:06:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:06:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:06:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:06:40,907 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:01,403 INFO L93 Difference]: Finished difference Result 402 states and 567 transitions. [2024-11-09 05:07:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:07:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:07:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:01,410 INFO L225 Difference]: With dead ends: 402 [2024-11-09 05:07:01,410 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 05:07:01,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:07:01,411 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 69 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:01,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 784 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 18.8s Time] [2024-11-09 05:07:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 05:07:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 176. [2024-11-09 05:07:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3630573248407643) internal successors, (214), 157 states have internal predecessors, (214), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-11-09 05:07:01,422 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 159 [2024-11-09 05:07:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:01,423 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-11-09 05:07:01,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-11-09 05:07:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:07:01,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:01,425 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:01,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:01,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:01,626 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:01,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1230220231, now seen corresponding path program 1 times [2024-11-09 05:07:01,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:01,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301814446] [2024-11-09 05:07:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:01,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:01,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:01,629 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:01,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:07:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:02,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 05:07:02,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:06,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:06,484 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 109 treesize of output 115 [2024-11-09 05:07:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:07:08,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:07:08,100 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301814446] [2024-11-09 05:07:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301814446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:07:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519684742] [2024-11-09 05:07:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:08,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:07:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:07:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:07:08,102 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:26,317 INFO L93 Difference]: Finished difference Result 398 states and 560 transitions. [2024-11-09 05:07:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:07:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:07:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:26,322 INFO L225 Difference]: With dead ends: 398 [2024-11-09 05:07:26,322 INFO L226 Difference]: Without dead ends: 225 [2024-11-09 05:07:26,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:07:26,324 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 63 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:26,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 957 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 17.5s Time] [2024-11-09 05:07:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-09 05:07:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 174. [2024-11-09 05:07:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.367741935483871) internal successors, (212), 155 states have internal predecessors, (212), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2024-11-09 05:07:26,332 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 159 [2024-11-09 05:07:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:26,333 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2024-11-09 05:07:26,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2024-11-09 05:07:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:07:26,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:26,334 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:26,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:26,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:26,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:26,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1552484425, now seen corresponding path program 1 times [2024-11-09 05:07:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827836458] [2024-11-09 05:07:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:26,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 [2024-11-09 05:07:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:26,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:26,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:27,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:07:27,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:27,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:27,474 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 50 treesize of output 38 [2024-11-09 05:07:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:07:27,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:07:27,569 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:27,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827836458] [2024-11-09 05:07:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827836458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:27,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:07:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219798995] [2024-11-09 05:07:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:27,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:07:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:07:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:07:27,572 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:32,115 INFO L93 Difference]: Finished difference Result 404 states and 570 transitions. [2024-11-09 05:07:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:07:32,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:07:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:32,118 INFO L225 Difference]: With dead ends: 404 [2024-11-09 05:07:32,118 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 05:07:32,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:07:32,119 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 70 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:32,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 787 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 05:07:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 05:07:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 176. [2024-11-09 05:07:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3630573248407643) internal successors, (214), 157 states have internal predecessors, (214), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-11-09 05:07:32,128 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 159 [2024-11-09 05:07:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-11-09 05:07:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-11-09 05:07:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:07:32,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:32,131 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:32,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:32,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:32,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 734835975, now seen corresponding path program 1 times [2024-11-09 05:07:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864502924] [2024-11-09 05:07:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:32,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:32,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:33,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:07:33,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:33,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:33,279 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 53 treesize of output 41 [2024-11-09 05:07:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:07:33,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:07:33,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:33,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864502924] [2024-11-09 05:07:33,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864502924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:33,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:33,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:07:33,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755027096] [2024-11-09 05:07:33,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:33,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:07:33,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:33,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:07:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:07:33,363 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:37,945 INFO L93 Difference]: Finished difference Result 407 states and 573 transitions. [2024-11-09 05:07:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:07:37,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:07:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:37,948 INFO L225 Difference]: With dead ends: 407 [2024-11-09 05:07:37,948 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 05:07:37,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:07:37,950 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 72 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:37,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 899 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 05:07:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 05:07:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2024-11-09 05:07:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2024-11-09 05:07:37,958 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 159 [2024-11-09 05:07:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2024-11-09 05:07:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2024-11-09 05:07:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 05:07:37,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:37,972 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:37,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:38,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:38,173 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:38,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:38,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1259308731, now seen corresponding path program 1 times [2024-11-09 05:07:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:38,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089531443] [2024-11-09 05:07:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:38,175 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:38,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:39,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:07:39,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:07:41,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:07:41,048 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:41,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089531443] [2024-11-09 05:07:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089531443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:07:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084875372] [2024-11-09 05:07:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:41,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:07:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:41,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:07:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:07:41,050 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:51,661 INFO L93 Difference]: Finished difference Result 402 states and 565 transitions. [2024-11-09 05:07:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:07:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 159 [2024-11-09 05:07:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:51,666 INFO L225 Difference]: With dead ends: 402 [2024-11-09 05:07:51,666 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 05:07:51,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:07:51,667 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 61 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:51,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 863 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-09 05:07:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 05:07:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2024-11-09 05:07:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 159 states have internal predecessors, (216), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2024-11-09 05:07:51,675 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 159 [2024-11-09 05:07:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:51,676 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2024-11-09 05:07:51,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2024-11-09 05:07:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 05:07:51,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:51,677 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:51,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:07:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:51,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1817735943, now seen corresponding path program 1 times [2024-11-09 05:07:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277345215] [2024-11-09 05:07:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:51,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:51,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:51,882 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:51,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:52,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:07:52,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:07:52,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:07:52,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277345215] [2024-11-09 05:07:52,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277345215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:52,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:07:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764234464] [2024-11-09 05:07:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:07:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:07:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:07:52,728 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:52,765 INFO L93 Difference]: Finished difference Result 354 states and 499 transitions. [2024-11-09 05:07:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:07:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-09 05:07:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:52,767 INFO L225 Difference]: With dead ends: 354 [2024-11-09 05:07:52,767 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 05:07:52,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:07:52,769 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:52,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:07:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 05:07:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-09 05:07:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 160 states have (on average 1.35625) internal successors, (217), 160 states have internal predecessors, (217), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:07:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2024-11-09 05:07:52,776 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 160 [2024-11-09 05:07:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:52,777 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2024-11-09 05:07:52,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:07:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2024-11-09 05:07:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 05:07:52,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:52,779 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:52,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:52,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:07:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 537872265, now seen corresponding path program 1 times [2024-11-09 05:07:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702897673] [2024-11-09 05:07:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:07:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:52,987 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:07:52,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:07:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:54,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:07:54,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:56,203 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 [2024-11-09 05:07:56,856 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 20 treesize of output 15 [2024-11-09 05:07:57,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 20 treesize of output 15 [2024-11-09 05:07:57,885 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 20 treesize of output 15 [2024-11-09 05:07:58,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2024-11-09 05:07:58,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:07:58,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:07:59,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 72 [2024-11-09 05:07:59,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 85 [2024-11-09 05:07:59,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:59,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 48 [2024-11-09 05:08:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 93 proven. 286 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-09 05:08:00,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:00,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_847 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_847))) (let ((.cse2 (store (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse7 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (let ((.cse5 (store .cse7 |c_~#unsigned_short_int_Array_0~0.base| .cse2))) (let ((.cse6 (select .cse5 |c_~#signed_char_Array_0~0.base|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (let ((.cse3 (store .cse6 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|) .cse4))) (or (not (let ((.cse1 (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse2) |c_~#signed_char_Array_0~0.base| (store .cse3 |c_~#signed_char_Array_0~0.offset| .cse4)) |c_~#double_Array_0~0.base| v_ArrVal_852))) (bvsgt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse5 |c_~#signed_char_Array_0~0.base| .cse3) |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) .cse4))))))))))) is different from false [2024-11-09 05:08:00,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:08:00,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702897673] [2024-11-09 05:08:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702897673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568515928] [2024-11-09 05:08:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:00,907 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:08:00,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:08:00,908 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:08:00,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-09 05:08:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:04,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 05:08:04,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:08:07,699 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 [2024-11-09 05:08:08,976 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 18 treesize of output 13 [2024-11-09 05:08:09,860 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 18 treesize of output 13 [2024-11-09 05:08:10,405 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 29 treesize of output 13 [2024-11-09 05:08:11,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2024-11-09 05:08:11,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-09 05:08:11,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:08:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-11-09 05:08:12,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2024-11-09 05:08:12,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 38 [2024-11-09 05:08:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 93 proven. 286 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-09 05:08:14,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:24,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (_ BitVec 32)) (v_ArrVal_905 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_property_#t~mem154#1_20| (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset| v_ArrVal_903)) |c_~#double_Array_0~0.base| v_ArrVal_905))) (bvsle (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) |v_ULTIMATE.start_property_#t~mem154#1_20|)))) is different from false [2024-11-09 05:08:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [568515928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230517459] [2024-11-09 05:08:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:28,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:08:28,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:08:28,980 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:08:28,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 05:08:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:29,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 05:08:29,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:08:32,789 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2024-11-09 05:08:32,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 80 [2024-11-09 05:08:32,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 21 [2024-11-09 05:08:32,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 21 [2024-11-09 05:08:32,999 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 33 treesize of output 19 [2024-11-09 05:08:33,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:08:33,672 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 37 treesize of output 33 [2024-11-09 05:08:34,139 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 41 treesize of output 30 [2024-11-09 05:08:34,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:08:34,864 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 77 treesize of output 35 [2024-11-09 05:08:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-09 05:08:36,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:36,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_950) |c_~#signed_char_Array_0~0.base|))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 |c_~#signed_char_Array_0~0.offset|)))))) is different from false [2024-11-09 05:08:37,543 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 94 treesize of output 82 [2024-11-09 05:08:37,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:08:37,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 70 [2024-11-09 05:08:37,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 [2024-11-09 05:08:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:08:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230517459] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:08:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 15, 10] total 44 [2024-11-09 05:08:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583339472] [2024-11-09 05:08:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:08:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:08:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:08:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:08:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2319, Unknown=44, NotChecked=306, Total=2970 [2024-11-09 05:08:38,636 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:08:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:08:46,682 INFO L93 Difference]: Finished difference Result 449 states and 628 transitions. [2024-11-09 05:08:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:08:46,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 160 [2024-11-09 05:08:46,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:08:46,685 INFO L225 Difference]: With dead ends: 449 [2024-11-09 05:08:46,686 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 05:08:46,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 649 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=329, Invalid=2719, Unknown=44, NotChecked=330, Total=3422 [2024-11-09 05:08:46,688 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 320 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:08:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 558 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 599 Invalid, 0 Unknown, 326 Unchecked, 5.6s Time] [2024-11-09 05:08:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 05:08:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2024-11-09 05:08:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:08:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 315 transitions. [2024-11-09 05:08:46,700 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 315 transitions. Word has length 160 [2024-11-09 05:08:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:08:46,701 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 315 transitions. [2024-11-09 05:08:46,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:08:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 315 transitions. [2024-11-09 05:08:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 05:08:46,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:08:46,703 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:08:46,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-09 05:08:46,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 05:08:47,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:08:47,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:08:47,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:08:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:08:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash -900655826, now seen corresponding path program 1 times [2024-11-09 05:08:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:08:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378476074] [2024-11-09 05:08:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:47,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:08:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:08:47,306 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:08:47,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:08:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:49,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 05:08:49,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:08:52,076 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 20 treesize of output 15 [2024-11-09 05:08:52,845 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 20 treesize of output 15 [2024-11-09 05:08:53,326 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 20 treesize of output 15 [2024-11-09 05:08:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2024-11-09 05:08:54,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:08:54,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:08:54,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:08:54,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 64 [2024-11-09 05:08:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2024-11-09 05:08:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 334 proven. 24 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-09 05:08:55,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:56,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1003))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-09 05:09:06,132 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse6 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1002))) (let ((.cse2 (select .cse6 |c_~#signed_char_Array_0~0.base|)) (.cse5 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse0 (let ((.cse7 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse7 (bvneg .cse7)))) (.cse1 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 .cse5))) (select (select .cse6 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))) (or (not (bvsle .cse0 .cse1)) (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |c_~#signed_char_Array_0~0.offset|))))) (bvslt .cse0 .cse1) (not (let ((.cse4 (store .cse6 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1003))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse3) .cse3)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse5))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:09:31,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse5 (store (let ((.cse11 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_998))) (let ((.cse8 (store (select .cse11 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse11 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base| (let ((.cse9 (select (store .cse11 |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base|))) (let ((.cse10 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (store (store .cse9 .cse4 .cse10) |c_~#signed_char_Array_0~0.offset| .cse10)))))) |c_~#double_Array_0~0.base| v_ArrVal_1002))) (let ((.cse1 (select .cse5 |c_~#signed_char_Array_0~0.base|))) (let ((.cse0 (let ((.cse7 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse7 (bvneg .cse7)))) (.cse6 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 .cse4))) (select (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))) (or (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |c_~#signed_char_Array_0~0.offset|))))) (not (let ((.cse3 (store .cse5 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1003))) (bvslt (let ((.cse2 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse2) .cse2)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) .cse4))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))) (bvslt .cse0 .cse6) (not (bvsle .cse0 .cse6)))))))) is different from false [2024-11-09 05:09:40,938 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:09:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378476074] [2024-11-09 05:09:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378476074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459151227] [2024-11-09 05:09:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:09:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:09:40,942 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:09:40,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-09 05:09:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:46,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 05:09:46,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:09:56,185 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 [2024-11-09 05:10:00,612 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 27 treesize of output 15 [2024-11-09 05:10:06,907 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 0 case distinctions, treesize of input 28 treesize of output 26 [2024-11-09 05:10:09,178 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 0 case distinctions, treesize of input 39 treesize of output 26 [2024-11-09 05:10:16,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2024-11-09 05:10:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:10:16,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:10:18,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:10:18,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 74 [2024-11-09 05:10:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2024-11-09 05:10:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 103 [2024-11-09 05:10:31,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 15 [2024-11-09 05:10:37,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:10:37,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 58 [2024-11-09 05:10:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 373 proven. 30 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-09 05:10:42,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:10:50,644 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1059 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1059))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) (bvslt (bvadd (bvneg ((_ zero_extend 16) |c_ULTIMATE.start_step_#t~mem61#1|)) ((_ zero_extend 16) |c_ULTIMATE.start_step_#t~mem60#1|)) (bvsrem ((_ sign_extend 24) |c_ULTIMATE.start_step_#t~mem62#1|) |c_ULTIMATE.start_step_#t~mem63#1|))) is different from false [2024-11-09 05:10:57,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1059 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1058))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (not (let ((.cse4 (store .cse1 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1059))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:11:13,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1056 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1053))) (let ((.cse8 (store (select .cse10 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse10 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (let ((.cse3 (store .cse10 |c_~#unsigned_short_int_Array_0~0.base| .cse8))) (let ((.cse9 (select .cse3 |c_~#signed_char_Array_0~0.base|))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (let ((.cse4 (store .cse9 .cse2 .cse5))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base| (store .cse4 |c_~#signed_char_Array_0~0.offset| v_ArrVal_1056)) |c_~#double_Array_0~0.base| v_ArrVal_1058))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse3 |c_~#signed_char_Array_0~0.base| .cse4) |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) .cse5))) (not (let ((.cse7 (store .cse1 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1059))) (bvslt (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse6 (bvneg .cse6))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse7 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse7 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))))))) is different from false [2024-11-09 05:11:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [459151227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:11:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422457697] [2024-11-09 05:11:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:11:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:11:17,519 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:11:17,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-09 05:11:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:18,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 05:11:18,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:11:21,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:11:21,875 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 32 treesize of output 35 [2024-11-09 05:11:25,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:11:25,034 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 59 treesize of output 27 [2024-11-09 05:11:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-09 05:11:30,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:11:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:11:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422457697] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 05:11:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:11:38,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 21, 10] total 48 [2024-11-09 05:11:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145082742] [2024-11-09 05:11:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:11:38,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:11:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:11:38,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:11:38,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2941, Unknown=65, NotChecked=714, Total=4160 [2024-11-09 05:11:38,720 INFO L87 Difference]: Start difference. First operand 225 states and 315 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:11:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:11:53,065 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2024-11-09 05:11:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:11:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 161 [2024-11-09 05:11:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:11:53,070 INFO L225 Difference]: With dead ends: 511 [2024-11-09 05:11:53,070 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 05:11:53,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 107.2s TimeCoverageRelationStatistics Valid=459, Invalid=3406, Unknown=65, NotChecked=762, Total=4692 [2024-11-09 05:11:53,073 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 71 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:11:53,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1221 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-11-09 05:11:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 05:11:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2024-11-09 05:11:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.3691588785046729) internal successors, (293), 214 states have internal predecessors, (293), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:11:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-11-09 05:11:53,085 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 161 [2024-11-09 05:11:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:11:53,086 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-11-09 05:11:53,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:11:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-11-09 05:11:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 05:11:53,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:53,088 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:11:53,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-09 05:11:53,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:53,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:11:53,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:11:53,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1921724180, now seen corresponding path program 1 times [2024-11-09 05:11:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:11:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804272583] [2024-11-09 05:11:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:53,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:11:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:11:53,691 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:11:53,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (28)] Waiting until timeout for monitored process [2024-11-09 05:11:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:55,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 05:11:55,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:04,171 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 20 treesize of output 15 [2024-11-09 05:12:06,303 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 20 treesize of output 15 [2024-11-09 05:12:07,706 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 20 treesize of output 15 [2024-11-09 05:12:09,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2024-11-09 05:12:09,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2024-11-09 05:12:09,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:12:09,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2024-11-09 05:12:10,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2024-11-09 05:12:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-09 05:12:11,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:13,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-09 05:12:17,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (or (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-09 05:12:21,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1154))) (let ((.cse0 (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse6) .cse6))) (.cse1 (select .cse3 |c_~#signed_char_Array_0~0.base|)) (.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (or (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |c_~#signed_char_Array_0~0.offset|))))) (bvslt .cse0 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 .cse2))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))) (not (let ((.cse5 (store .cse3 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse4 (bvneg .cse4))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))))))) is different from false [2024-11-09 05:12:22,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse3 (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|))) (store .cse7 |c_~#signed_char_Array_0~0.offset| ((_ sign_extend 24) ((_ extract 7 0) (select .cse7 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|))))))) |c_~#double_Array_0~0.base| v_ArrVal_1154))) (let ((.cse0 (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse6 (bvneg .cse6)))) (.cse1 (select .cse3 |c_~#signed_char_Array_0~0.base|)) (.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (or (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |c_~#signed_char_Array_0~0.offset|))))) (bvslt .cse0 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 .cse2))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))) (not (let ((.cse5 (store .cse3 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse4) .cse4)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse5 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))))))) is different from false [2024-11-09 05:12:27,699 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1154 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1151 (_ BitVec 32)) (|~#signed_short_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse3 (store (let ((.cse9 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1150))) (let ((.cse7 (store (select .cse9 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse9 |c_~#signed_short_int_Array_0~0.base|) (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse7) |c_~#signed_char_Array_0~0.base| (let ((.cse8 (select (store .cse9 |c_~#unsigned_short_int_Array_0~0.base| .cse7) |c_~#signed_char_Array_0~0.base|))) (store (store .cse8 .cse2 v_ArrVal_1151) |c_~#signed_char_Array_0~0.offset| ((_ sign_extend 24) ((_ extract 7 0) (select .cse8 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|))))))))) |c_~#double_Array_0~0.base| v_ArrVal_1154))) (let ((.cse4 (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse6) .cse6))) (.cse5 (select .cse3 |c_~#signed_char_Array_0~0.base|))) (or (not (let ((.cse1 (store .cse3 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))) (bvslt .cse4 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 .cse2))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))) (not (bvsgt .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:12:34,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:12:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804272583] [2024-11-09 05:12:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804272583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419076548] [2024-11-09 05:12:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:34,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:12:34,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:12:34,207 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:12:34,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-09 05:12:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:38,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:12:38,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:51,679 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 [2024-11-09 05:12:57,648 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 27 treesize of output 15 [2024-11-09 05:13:05,353 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 0 case distinctions, treesize of input 28 treesize of output 26 [2024-11-09 05:13:08,309 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 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 05:13:19,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2024-11-09 05:13:19,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:13:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:13:21,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:13:21,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 78 [2024-11-09 05:13:23,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-11-09 05:13:36,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 101 [2024-11-09 05:13:36,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-09 05:13:42,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:13:42,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 61 [2024-11-09 05:13:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 375 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 05:13:46,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:13:47,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1210))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-09 05:13:54,246 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1209))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (not (let ((.cse4 (store .cse1 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:14:09,370 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1207 (_ BitVec 32)) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1206))) (let ((.cse8 (store (select .cse10 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse10 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (let ((.cse3 (store .cse10 |c_~#unsigned_short_int_Array_0~0.base| .cse8))) (let ((.cse9 (select .cse3 |c_~#signed_char_Array_0~0.base|))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (let ((.cse4 (store .cse9 .cse2 .cse5))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base| (store .cse4 |c_~#signed_char_Array_0~0.offset| v_ArrVal_1207)) |c_~#double_Array_0~0.base| v_ArrVal_1209))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse3 |c_~#signed_char_Array_0~0.base| .cse4) |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) .cse5))) (not (let ((.cse7 (store .cse1 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1155))) (bvslt (let ((.cse6 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse6 (bvneg .cse6))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse7 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse7 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))))))) is different from false [2024-11-09 05:14:14,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1419076548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:14:14,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624688830] [2024-11-09 05:14:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:14:14,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:14:14,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:14,163 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:14:14,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 05:14:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:14:15,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:14:15,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:14:27,811 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 [2024-11-09 05:14:27,975 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 [2024-11-09 05:14:33,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:14:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 47 [2024-11-09 05:14:35,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:14:35,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 30 [2024-11-09 05:14:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:14:40,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:14:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624688830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:14:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:14:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 22] total 37 [2024-11-09 05:14:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065805041] [2024-11-09 05:14:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:14:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:14:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:14:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:14:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1621, Unknown=22, NotChecked=744, Total=2756 [2024-11-09 05:14:40,126 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:14:52,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:15:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:15:14,413 INFO L93 Difference]: Finished difference Result 512 states and 717 transitions. [2024-11-09 05:15:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:15:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 161 [2024-11-09 05:15:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:15:14,417 INFO L225 Difference]: With dead ends: 512 [2024-11-09 05:15:14,417 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 05:15:14,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 79.3s TimeCoverageRelationStatistics Valid=395, Invalid=1967, Unknown=22, NotChecked=808, Total=3192 [2024-11-09 05:15:14,419 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 402 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:15:14,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 443 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 28.7s Time] [2024-11-09 05:15:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 05:15:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 233. [2024-11-09 05:15:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.3644859813084111) internal successors, (292), 214 states have internal predecessors, (292), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:15:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 326 transitions. [2024-11-09 05:15:14,442 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 326 transitions. Word has length 161 [2024-11-09 05:15:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:15:14,442 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 326 transitions. [2024-11-09 05:15:14,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:15:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 326 transitions. [2024-11-09 05:15:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 05:15:14,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:14,444 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:15:14,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-09 05:15:14,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (28)] Ended with exit code 0 [2024-11-09 05:15:14,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-09 05:15:15,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:15:15,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:15,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1588873136, now seen corresponding path program 1 times [2024-11-09 05:15:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:15:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43345332] [2024-11-09 05:15:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:15:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:15:15,048 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:15:15,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (31)] Waiting until timeout for monitored process [2024-11-09 05:15:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:15:16,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:15:16,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:15:30,241 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 20 treesize of output 15 [2024-11-09 05:15:33,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 20 treesize of output 15 [2024-11-09 05:15:34,928 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 20 treesize of output 15 [2024-11-09 05:15:36,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2024-11-09 05:15:36,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:15:36,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:15:37,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:15:37,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2024-11-09 05:15:38,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-11-09 05:15:40,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:15:40,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 93 [2024-11-09 05:15:42,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:15:42,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 51 [2024-11-09 05:15:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 283 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-09 05:15:44,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:15:53,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~ite75#1| (_ BitVec 32)) (|~#signed_short_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse3 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv2 32)))) (let ((.cse1 (store (let ((.cse7 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1303))) (let ((.cse4 (store (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse7 |c_~#signed_short_int_Array_0~0.base|) .cse3)))))) (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse4) |c_~#signed_char_Array_0~0.base| (let ((.cse5 (select (store .cse7 |c_~#unsigned_short_int_Array_0~0.base| .cse4) |c_~#signed_char_Array_0~0.base|))) (let ((.cse6 ((_ sign_extend 24) ((_ extract 7 0) (select .cse5 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (store (store .cse5 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|) .cse6) |c_~#signed_char_Array_0~0.offset| .cse6)))))) |c_~#double_Array_0~0.base| v_ArrVal_1309))) (let ((.cse2 (select .cse1 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse0 (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse2 |~#signed_short_int_Array_0~0.offset|))) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select .cse2 .cse3))))))) (or (not (bvslt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select (store .cse1 |c_~#signed_short_int_Array_0~0.base| (store .cse2 (bvadd |~#signed_short_int_Array_0~0.offset| (_ bv4 32)) ((_ sign_extend 16) ((_ extract 15 0) |ULTIMATE.start_step_#t~ite75#1|)))) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|))))) (bvslt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:15:56,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:15:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43345332] [2024-11-09 05:15:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43345332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:15:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122853437] [2024-11-09 05:15:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:56,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:15:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:15:56,068 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:15:56,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-09 05:16:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:00,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:16:00,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:16:13,548 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 [2024-11-09 05:16:20,254 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 37 treesize of output 19 [2024-11-09 05:16:28,393 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 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 05:16:31,697 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 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-09 05:16:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2024-11-09 05:16:41,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:16:41,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2024-11-09 05:16:43,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:16:43,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 78 [2024-11-09 05:16:45,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2024-11-09 05:16:56,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 95 [2024-11-09 05:16:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-09 05:17:03,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:17:03,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 59 [2024-11-09 05:17:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 383 proven. 30 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-09 05:17:06,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:17:12,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1363))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))) is different from false [2024-11-09 05:17:25,749 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse1 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1362))) (or (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (not (let ((.cse4 (store .cse1 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1363))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))) is different from false [2024-11-09 05:17:39,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1358 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1360 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1358))) (let ((.cse8 (store (select .cse10 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse10 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (let ((.cse5 (store .cse10 |c_~#unsigned_short_int_Array_0~0.base| .cse8))) (let ((.cse9 (select .cse5 |c_~#signed_char_Array_0~0.base|))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|)) (.cse7 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (let ((.cse6 (store .cse9 .cse2 .cse7))) (let ((.cse3 (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base| (store .cse6 |c_~#signed_char_Array_0~0.offset| v_ArrVal_1360)) |c_~#double_Array_0~0.base| v_ArrVal_1362))) (or (not (let ((.cse1 (store .cse3 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1363))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse0 (bvneg .cse0))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))))) (bvslt (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse4 (bvneg .cse4))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse3 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (bvsle ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse5 |c_~#signed_char_Array_0~0.base| .cse6) |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) .cse7)))))))))))) is different from false [2024-11-09 05:17:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122853437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:17:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783454667] [2024-11-09 05:17:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:17:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:17:44,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:17:44,043 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:17:44,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-09 05:17:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:17:45,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:17:45,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:17:58,460 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 35 treesize of output 30 [2024-11-09 05:17:58,826 INFO L349 Elim1Store]: treesize reduction 50, result has 20.6 percent of original size [2024-11-09 05:17:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 95 [2024-11-09 05:17:58,959 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 40 treesize of output 17 [2024-11-09 05:17:59,665 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 21 treesize of output 21 [2024-11-09 05:17:59,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:17:59,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2024-11-09 05:17:59,801 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:18:01,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:18:01,604 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 37 treesize of output 33 [2024-11-09 05:18:03,901 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 41 treesize of output 30 [2024-11-09 05:18:09,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:18:09,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 76 [2024-11-09 05:18:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 05:18:14,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:18:14,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783454667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:18:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:18:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 23] total 44 [2024-11-09 05:18:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978033671] [2024-11-09 05:18:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:18:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:18:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:18:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:18:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2714, Unknown=15, NotChecked=452, Total=3660 [2024-11-09 05:18:14,422 INFO L87 Difference]: Start difference. First operand 233 states and 326 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:18:38,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:18:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:18:39,598 INFO L93 Difference]: Finished difference Result 585 states and 814 transitions. [2024-11-09 05:18:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:18:39,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 161 [2024-11-09 05:18:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:18:39,602 INFO L225 Difference]: With dead ends: 585 [2024-11-09 05:18:39,602 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 05:18:39,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 84.2s TimeCoverageRelationStatistics Valid=536, Invalid=3125, Unknown=15, NotChecked=484, Total=4160 [2024-11-09 05:18:39,605 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 603 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:18:39,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 403 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 744 Invalid, 1 Unknown, 0 Unchecked, 20.4s Time] [2024-11-09 05:18:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 05:18:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 242. [2024-11-09 05:18:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 223 states have (on average 1.3677130044843049) internal successors, (305), 223 states have internal predecessors, (305), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 05:18:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 339 transitions. [2024-11-09 05:18:39,629 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 339 transitions. Word has length 161 [2024-11-09 05:18:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:18:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 339 transitions. [2024-11-09 05:18:39,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-09 05:18:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 339 transitions. [2024-11-09 05:18:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 05:18:39,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:18:39,632 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:18:39,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-09 05:18:39,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (31)] Forceful destruction successful, exit code 0 [2024-11-09 05:18:40,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2024-11-09 05:18:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:18:40,233 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:18:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:18:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 567804782, now seen corresponding path program 1 times [2024-11-09 05:18:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:18:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502650154] [2024-11-09 05:18:40,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:18:40,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:18:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:18:40,235 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:18:40,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/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 (34)] Waiting until timeout for monitored process [2024-11-09 05:18:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:18:42,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 05:18:42,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:18:56,156 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 20 treesize of output 15 [2024-11-09 05:18:59,278 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 20 treesize of output 15 [2024-11-09 05:19:01,475 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 20 treesize of output 15 [2024-11-09 05:19:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2024-11-09 05:19:05,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2024-11-09 05:19:05,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 26 [2024-11-09 05:19:06,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:19:06,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 64 [2024-11-09 05:19:07,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2024-11-09 05:19:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 334 proven. 24 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-09 05:19:09,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:19:30,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1465 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse6 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1464))) (let ((.cse1 (select .cse6 |c_~#signed_char_Array_0~0.base|)) (.cse5 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse0 (let ((.cse7 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse7 (bvneg .cse7)))) (.cse2 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 .cse5))) (select (select .cse6 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))) (or (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 |c_~#signed_char_Array_0~0.offset|))))) (not (bvsle .cse0 .cse2)) (not (let ((.cse4 (store .cse6 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1465))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse5))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))) (bvslt .cse0 .cse2)))))) is different from false [2024-11-09 05:19:33,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1465 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse6 (store (store |c_#memory_int| |c_~#signed_char_Array_0~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|))) (store .cse8 |c_~#signed_char_Array_0~0.offset| ((_ sign_extend 24) ((_ extract 7 0) (select .cse8 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|))))))) |c_~#double_Array_0~0.base| v_ArrVal_1464))) (let ((.cse2 (select .cse6 |c_~#signed_char_Array_0~0.base|)) (.cse5 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse1 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 .cse5))) (select (select .cse6 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))) (.cse0 (let ((.cse7 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse6 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse7 (bvneg .cse7))))) (or (bvslt .cse0 .cse1) (not (bvsle .cse0 .cse1)) (not (bvsgt .cse0 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |c_~#signed_char_Array_0~0.offset|))))) (not (let ((.cse4 (store .cse6 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1465))) (bvslt (let ((.cse3 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse3 (bvneg .cse3))) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse4 |c_~#signed_char_Array_0~0.base|) .cse5))) (select (select .cse4 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2024-11-09 05:19:39,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1464 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1465 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse3 (store (let ((.cse11 (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1458))) (let ((.cse8 (store (select .cse11 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse11 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))))) (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base| (let ((.cse9 (select (store .cse11 |c_~#unsigned_short_int_Array_0~0.base| .cse8) |c_~#signed_char_Array_0~0.base|))) (let ((.cse10 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 (bvadd (_ bv2 32) |c_~#signed_char_Array_0~0.offset|)))))) (store (store .cse9 .cse2 .cse10) |c_~#signed_char_Array_0~0.offset| .cse10)))))) |c_~#double_Array_0~0.base| v_ArrVal_1464))) (let ((.cse6 (select .cse3 |c_~#signed_char_Array_0~0.base|))) (let ((.cse4 (let ((.cse7 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse7) .cse7))) (.cse5 (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 .cse2))) (select (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|)))) (or (not (let ((.cse1 (store .cse3 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1465))) (bvslt (let ((.cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg .cse0) .cse0)) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse1 |c_~#signed_char_Array_0~0.base|) .cse2))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|))))) (bvslt .cse4 .cse5) (not (bvsgt .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 |c_~#signed_char_Array_0~0.offset|))))) (not (bvsle .cse4 .cse5)))))))) is different from false [2024-11-09 05:19:50,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:19:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502650154] [2024-11-09 05:19:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502650154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:19:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1245589457] [2024-11-09 05:19:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:19:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:19:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:19:50,882 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:19:50,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa6b974-9d7d-40fb-bb9c-6921bd09de02/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-09 05:19:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:19:55,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 05:19:55,369 INFO L278 TraceCheckSpWp]: Computing forward predicates...