./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:26:24,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:24,925 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:26:24,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:24,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:24,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:24,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:24,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:24,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:24,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:24,992 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:26:24,993 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:26:24,994 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:26:24,994 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:26:24,994 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:26:24,995 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:26:24,995 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:26:24,996 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:26:24,996 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:26:25,001 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:26:25,001 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:26:25,002 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:26:25,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:25,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:25,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:25,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:26:25,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:25,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:25,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:25,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:25,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:25,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:25,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:25,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:25,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:25,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:25,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:25,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:25,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:25,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:25,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:25,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:25,017 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:26:25,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:26:25,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:25,017 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:26:25,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:25,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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 -> c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd [2024-11-09 01:26:25,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:25,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:25,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:25,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:25,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:25,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i Unable to find full path for "g++" [2024-11-09 01:26:27,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:27,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:28,000 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-11-09 01:26:28,012 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/bebbcbde2/9e5815a636454ab796bf46d815ec6c9c/FLAG28992eb85 [2024-11-09 01:26:28,031 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/bebbcbde2/9e5815a636454ab796bf46d815ec6c9c [2024-11-09 01:26:28,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:28,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:28,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:28,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:28,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:28,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697bd2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28, skipping insertion in model container [2024-11-09 01:26:28,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:28,325 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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-11-09 01:26:28,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:28,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:28,414 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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-11-09 01:26:28,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:28,503 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:28,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28 WrapperNode [2024-11-09 01:26:28,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:28,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:28,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:28,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:28,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,577 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-09 01:26:28,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:28,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:28,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:28,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:28,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:28,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:28,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:28,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:28,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (1/1) ... [2024-11-09 01:26:28,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:28,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:28,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:26:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 01:26:28,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 01:26:28,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:26:28,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-09 01:26:28,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:28,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:28,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:26:28,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:28,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:28,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:28,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:29,604 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:29,604 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:30,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:30,394 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:30,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:30 BoogieIcfgContainer [2024-11-09 01:26:30,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:30,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:30,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:30,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:30,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:28" (1/3) ... [2024-11-09 01:26:30,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17930028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:30, skipping insertion in model container [2024-11-09 01:26:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:28" (2/3) ... [2024-11-09 01:26:30,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17930028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:30, skipping insertion in model container [2024-11-09 01:26:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:30" (3/3) ... [2024-11-09 01:26:30,407 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-7.i [2024-11-09 01:26:30,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:30,431 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:30,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:30,532 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;@f37103c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:30,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 01:26:30,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:30,550 INFO L215 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:30,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:30,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -589415742, now seen corresponding path program 1 times [2024-11-09 01:26:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:26:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409222740] [2024-11-09 01:26:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:26:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921200342] [2024-11-09 01:26:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:33,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:33,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:33,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:26:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:34,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:26:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:35,088 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:26:35,091 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:26:35,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:26:35,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:26:35,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 01:26:35,302 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 01:26:35,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:26:35,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:26:35 BoogieIcfgContainer [2024-11-09 01:26:35,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:26:35,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:26:35,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:26:35,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:26:35,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:30" (3/4) ... [2024-11-09 01:26:35,477 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:26:35,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:26:35,480 INFO L158 Benchmark]: Toolchain (without parser) took 7443.40ms. Allocated memory was 142.6MB in the beginning and 253.8MB in the end (delta: 111.1MB). Free memory was 108.3MB in the beginning and 196.4MB in the end (delta: -88.1MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,481 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:35,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.51ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 106.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 103.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,484 INFO L158 Benchmark]: Boogie Preprocessor took 45.54ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 100.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,485 INFO L158 Benchmark]: RCFGBuilder took 1771.52ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 66.0MB in the end (delta: 34.3MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,486 INFO L158 Benchmark]: TraceAbstraction took 5072.47ms. Allocated memory was 142.6MB in the beginning and 253.8MB in the end (delta: 111.1MB). Free memory was 66.0MB in the beginning and 196.4MB in the end (delta: -130.4MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-11-09 01:26:35,486 INFO L158 Benchmark]: Witness Printer took 7.14ms. Allocated memory is still 253.8MB. Free memory is still 196.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:35,490 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.40ms. Allocated memory is still 111.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.51ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 106.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 103.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.54ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 100.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1771.52ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 66.0MB in the end (delta: 34.3MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5072.47ms. Allocated memory was 142.6MB in the beginning and 253.8MB in the end (delta: 111.1MB). Free memory was 66.0MB in the beginning and 196.4MB in the end (delta: -130.4MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 7.14ms. Allocated memory is still 253.8MB. Free memory is still 196.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_3 = 8.2; [L25] float* var_1_3_Pointer = &(var_1_3); [L26] float var_1_4 = 100000000000.4; [L27] float* var_1_4_Pointer = &(var_1_4); [L28] unsigned char var_1_6 = 4; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] double var_1_7 = 0.2; [L31] double* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 0; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] unsigned short int var_1_9 = 32; [L35] unsigned short int* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 1; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] double var_1_11 = 127.5; [L39] double* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 5; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] double last_1_var_1_7 = 0.2; [L43] unsigned long int last_1_var_1_12 = 5; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR \read(var_1_7) [L99] last_1_var_1_7 = var_1_7 [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_float() [L79] EXPR \read(var_1_3) [L79] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F [L79] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) [L79] EXPR \read(var_1_3) [L79] EXPR var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F [L79] EXPR \read(var_1_3) [L79] EXPR var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F [L79] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_4 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_4) [L81] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L81] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) [L81] EXPR \read(var_1_4) [L81] EXPR var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F [L81] EXPR \read(var_1_4) [L81] EXPR var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F [L81] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_6 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] var_1_8 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_9 = __VERIFIER_nondet_ushort() [L89] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_11 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_11) [L96] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L96] EXPR \read(var_1_11) [L96] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L96] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] RET updateVariables() [L112] CALL step() [L47] EXPR \read(*var_1_3_Pointer) [L47] EXPR \read(*var_1_4_Pointer) [L47] COND FALSE !(! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) [L54] EXPR \read(*var_1_6_Pointer) [L54] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L56] EXPR \read(*var_1_8_Pointer) [L56] (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L56] EXPR \read(*var_1_6_Pointer) [L56] EXPR \read(*var_1_9_Pointer) [L56] EXPR \read(*var_1_1_Pointer) [L56] (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L56] COND FALSE !((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) [L63] EXPR \read(*var_1_11_Pointer) [L63] (*(var_1_7_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_8_Pointer) [L65] COND FALSE !((*(var_1_8_Pointer))) [L74] EXPR \read(*var_1_6_Pointer) [L74] (*(var_1_12_Pointer)) = (*(var_1_6_Pointer)) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*var_1_3_Pointer) [L103] EXPR \read(*var_1_4_Pointer) [L103] EXPR (! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR \read(*var_1_6_Pointer) [L103] EXPR (! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L103] EXPR ((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) [L103] EXPR \read(*var_1_8_Pointer) [L103] EXPR (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L103] EXPR \read(*var_1_6_Pointer) [L103] EXPR \read(*var_1_9_Pointer) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR (*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer))) [L103] EXPR ((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L103] EXPR \read(*var_1_7_Pointer) [L103] EXPR \read(*var_1_11_Pointer) [L103] EXPR ((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L103] EXPR ((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) [L103] EXPR (((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))))) && ((*(var_1_8_Pointer)) ? (((*(var_1_10_Pointer)) && ((*(var_1_4_Pointer)) <= (*(var_1_7_Pointer)))) ? (((((((*(var_1_4_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_11_Pointer))))) > (*(var_1_7_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) > ((*(var_1_9_Pointer)))) ? (((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) : 1) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) [L103-L104] return (((! (last_1_var_1_7 <= ((*(var_1_3_Pointer)) - (*(var_1_4_Pointer))))) ? ((-1 < last_1_var_1_12) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_8_Pointer)) || (((*(var_1_6_Pointer)) / (*(var_1_9_Pointer))) >= (*(var_1_1_Pointer)))) ? (((*(var_1_8_Pointer)) && (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_7_Pointer)) == ((double) (*(var_1_11_Pointer)))))) && ((*(var_1_8_Pointer)) ? (((*(var_1_10_Pointer)) && ((*(var_1_4_Pointer)) <= (*(var_1_7_Pointer)))) ? (((((((*(var_1_4_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_11_Pointer))))) > (*(var_1_7_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) > ((*(var_1_9_Pointer)))) ? (((3725801564u - (*(var_1_6_Pointer))) - (*(var_1_1_Pointer)))) : ((*(var_1_9_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) : 1) : ((*(var_1_12_Pointer)) == ((unsigned long int) (*(var_1_6_Pointer))))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_7=1/5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 1, TraceHistogramMax: 12, 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=33occurred 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, 3.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 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 01:26:35,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:26:37,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:38,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 01:26:38,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:38,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:38,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:38,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:38,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:38,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:38,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:38,148 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:26:38,148 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:26:38,148 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:26:38,149 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:26:38,149 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:26:38,153 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:26:38,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:38,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:38,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:38,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:38,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:38,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:38,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:38,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:38,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:26:38,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:26:38,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:38,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:26:38,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:38,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:38,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:38,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:38,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:38,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:38,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:38,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:38,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:38,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:38,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:38,166 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 01:26:38,166 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:38,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:38,168 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:26:38,168 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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 -> c2fe4ae066b211b5bec71bcf45317806f780f2f67771ab1af9ef585ca835c0fd [2024-11-09 01:26:38,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:38,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:38,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:38,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:38,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:38,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i Unable to find full path for "g++" [2024-11-09 01:26:40,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:40,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:40,948 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i [2024-11-09 01:26:40,957 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/e33c4dfb0/88d2622ba42d427f9edc1296cb64f88a/FLAG81bac2f0a [2024-11-09 01:26:40,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/data/e33c4dfb0/88d2622ba42d427f9edc1296cb64f88a [2024-11-09 01:26:40,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:40,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:40,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:40,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:40,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:40,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e6f87f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40, skipping insertion in model container [2024-11-09 01:26:40,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:41,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:41,239 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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-11-09 01:26:41,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:41,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:41,374 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_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-7.i[915,928] [2024-11-09 01:26:41,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:41,465 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:41,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41 WrapperNode [2024-11-09 01:26:41,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:41,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:41,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:41,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:41,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,548 INFO L138 Inliner]: procedures = 39, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-09 01:26:41,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:41,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:41,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:41,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:41,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:41,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:41,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:41,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:41,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (1/1) ... [2024-11-09 01:26:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:26:41,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:41,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:41,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-09 01:26:41,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-09 01:26:41,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-09 01:26:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 01:26:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-09 01:26:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-09 01:26:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-09 01:26:41,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-09 01:26:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-09 01:26:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 01:26:41,878 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:41,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:44,859 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:44,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:44,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:44,889 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:44,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:44 BoogieIcfgContainer [2024-11-09 01:26:44,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:44,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:44,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:44,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:44,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:40" (1/3) ... [2024-11-09 01:26:44,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a7279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:44, skipping insertion in model container [2024-11-09 01:26:44,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:41" (2/3) ... [2024-11-09 01:26:44,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a7279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:44, skipping insertion in model container [2024-11-09 01:26:44,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:44" (3/3) ... [2024-11-09 01:26:44,902 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-7.i [2024-11-09 01:26:44,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:44,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:45,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:45,019 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;@3affd89a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:45,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:26:45,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:45,055 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:45,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 688926525, now seen corresponding path program 1 times [2024-11-09 01:26:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629648583] [2024-11-09 01:26:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:45,086 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 01:26:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:45,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:45,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:45,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:26:45,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-09 01:26:45,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:45,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629648583] [2024-11-09 01:26:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629648583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:45,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477859704] [2024-11-09 01:26:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:45,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:45,637 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:45,680 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2024-11-09 01:26:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-09 01:26:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:45,691 INFO L225 Difference]: With dead ends: 193 [2024-11-09 01:26:45,692 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 01:26:45,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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 01:26:45,704 INFO L432 NwaCegarLoop]: 138 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, 138 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 01:26:45,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 01:26:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 01:26:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-09 01:26:45,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2024-11-09 01:26:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-09 01:26:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-09 01:26:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:26:45,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:45,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:45,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1426372397, now seen corresponding path program 1 times [2024-11-09 01:26:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846659904] [2024-11-09 01:26:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:46,010 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 01:26:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:46,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:46,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:26:46,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:26:46,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:46,598 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846659904] [2024-11-09 01:26:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846659904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:26:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952723127] [2024-11-09 01:26:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:46,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:26:46,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:26:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:26:46,606 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:46,683 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-09 01:26:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:26:46,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-09 01:26:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:46,686 INFO L225 Difference]: With dead ends: 191 [2024-11-09 01:26:46,686 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:26:46,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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 01:26:46,688 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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 01:26:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:26:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:26:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:26:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-09 01:26:46,715 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2024-11-09 01:26:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:46,716 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-09 01:26:46,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-09 01:26:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:26:46,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:46,719 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:46,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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)] Ended with exit code 0 [2024-11-09 01:26:46,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2097861333, now seen corresponding path program 1 times [2024-11-09 01:26:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887087780] [2024-11-09 01:26:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:46,922 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 01:26:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:46,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:46,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:47,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:26:47,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:26:47,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:47,453 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887087780] [2024-11-09 01:26:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887087780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:26:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340944868] [2024-11-09 01:26:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:26:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:47,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:26:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:26:47,457 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:26:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:47,509 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-09 01:26:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:26:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:26:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:47,513 INFO L225 Difference]: With dead ends: 194 [2024-11-09 01:26:47,513 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:26:47,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 01:26:47,515 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:47,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:26:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 01:26:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-09 01:26:47,539 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 103 [2024-11-09 01:26:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:47,540 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-09 01:26:47,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:26:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-09 01:26:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 01:26:47,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:47,545 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:47,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:47,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1185988713, now seen corresponding path program 1 times [2024-11-09 01:26:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:47,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631567653] [2024-11-09 01:26:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:47,749 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 01:26:47,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:47,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:47,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:48,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:26:48,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:48,440 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 77 treesize of output 41 [2024-11-09 01:26:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:26:48,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:48,501 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:48,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631567653] [2024-11-09 01:26:48,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631567653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:48,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:26:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773450829] [2024-11-09 01:26:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:26:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:26:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:26:48,504 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:26:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:51,062 INFO L93 Difference]: Finished difference Result 196 states and 280 transitions. [2024-11-09 01:26:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:26:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-09 01:26:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:51,065 INFO L225 Difference]: With dead ends: 196 [2024-11-09 01:26:51,065 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 01:26:51,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 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 01:26:51,067 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 133 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 381 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 01:26:51,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 01:26:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-09 01:26:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-11-09 01:26:51,081 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 103 [2024-11-09 01:26:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:51,081 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-11-09 01:26:51,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:26:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-11-09 01:26:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:26:51,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:51,087 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:51,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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)] Ended with exit code 0 [2024-11-09 01:26:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:51,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1971359683, now seen corresponding path program 1 times [2024-11-09 01:26:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000135211] [2024-11-09 01:26:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:51,290 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 01:26:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:51,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:51,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:51,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:26:51,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:51,866 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 77 treesize of output 41 [2024-11-09 01:26:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:26:51,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:51,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000135211] [2024-11-09 01:26:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000135211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:26:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777513397] [2024-11-09 01:26:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:51,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:26:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:26:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:26:51,913 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:54,617 INFO L93 Difference]: Finished difference Result 195 states and 277 transitions. [2024-11-09 01:26:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:26:54,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-09 01:26:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:54,619 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:26:54,619 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:26:54,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:26:54,621 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 121 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:54,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 376 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 01:26:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:26:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 01:26:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:26:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-09 01:26:54,631 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 105 [2024-11-09 01:26:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-09 01:26:54,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:26:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-09 01:26:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:26:54,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:54,634 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:26:54,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:54,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 691221931, now seen corresponding path program 1 times [2024-11-09 01:26:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:26:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038988233] [2024-11-09 01:26:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:54,836 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 01:26:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:26:54,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:54,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:26:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:55,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:26:55,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:55,390 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 76 treesize of output 40 [2024-11-09 01:26:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:26:55,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:55,792 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 46 treesize of output 22 [2024-11-09 01:26:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:26:55,809 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:26:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038988233] [2024-11-09 01:26:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038988233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1467208809] [2024-11-09 01:26:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:26:55,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:26:55,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-09 01:26:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:57,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:26:57,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:57,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2024-11-09 01:26:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:26:57,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:58,243 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 70 treesize of output 34 [2024-11-09 01:26:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:26:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1467208809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249638532] [2024-11-09 01:26:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:58,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:58,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:58,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:58,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:26:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:58,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:26:58,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:58,776 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 76 treesize of output 40 [2024-11-09 01:26:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 01:26:58,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:59,035 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 46 treesize of output 22 [2024-11-09 01:26:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:26:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249638532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:59,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 01:26:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10, 9, 9, 8] total 16 [2024-11-09 01:26:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958986666] [2024-11-09 01:26:59,056 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 01:26:59,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 01:26:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:26:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 01:26:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:26:59,059 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-09 01:27:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:04,152 INFO L93 Difference]: Finished difference Result 205 states and 287 transitions. [2024-11-09 01:27:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:27:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 107 [2024-11-09 01:27:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:04,154 INFO L225 Difference]: With dead ends: 205 [2024-11-09 01:27:04,155 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:27:04,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 621 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-11-09 01:27:04,157 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 132 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:04,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 591 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 01:27:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:27:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 01:27:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:27:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2024-11-09 01:27:04,176 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 107 [2024-11-09 01:27:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:04,176 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2024-11-09 01:27:04,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-09 01:27:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2024-11-09 01:27:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:27:04,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:04,179 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:04,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:27:04,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-09 01:27:04,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:04,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1663163351, now seen corresponding path program 1 times [2024-11-09 01:27:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127326047] [2024-11-09 01:27:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:04,782 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 01:27:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:04,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:27:04,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:27:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:05,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:27:05,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:08,155 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 01:27:08,665 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 01:27:09,353 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 01:27:09,744 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 01:27:09,985 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 17 treesize of output 17 [2024-11-09 01:27:10,129 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 22 treesize of output 20 [2024-11-09 01:27:10,231 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 22 treesize of output 20 [2024-11-09 01:27:10,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-09 01:27:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 01:27:10,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:10,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((~var_1_1_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_205 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset))))) c_~var_1_7_Pointer~0.base v_ArrVal_204) c_~var_1_12_Pointer~0.base v_ArrVal_205))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2024-11-09 01:27:10,788 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:27:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127326047] [2024-11-09 01:27:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127326047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1762164549] [2024-11-09 01:27:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:27:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:27:10,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:27:10,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 01:27:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:12,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:27:12,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:14,718 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 12 treesize of output 8 [2024-11-09 01:27:15,483 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 17 treesize of output 12 [2024-11-09 01:27:16,105 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 17 treesize of output 12 [2024-11-09 01:27:16,911 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 17 treesize of output 12 [2024-11-09 01:27:17,447 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 17 treesize of output 12 [2024-11-09 01:27:17,797 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 26 treesize of output 21 [2024-11-09 01:27:17,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-09 01:27:18,092 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 27 treesize of output 25 [2024-11-09 01:27:18,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-11-09 01:27:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 01:27:18,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1762164549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381819395] [2024-11-09 01:27:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:18,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:27:18,503 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:18,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:27:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 01:27:20,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:22,114 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 17 treesize of output 17 [2024-11-09 01:27:22,191 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 22 treesize of output 20 [2024-11-09 01:27:22,237 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 22 treesize of output 20 [2024-11-09 01:27:22,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-09 01:27:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:27:22,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:22,834 INFO L349 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2024-11-09 01:27:22,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-09 01:27:22,869 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:27:22,869 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 708 treesize of output 636 [2024-11-09 01:27:22,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:22,934 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 318 treesize of output 310 [2024-11-09 01:27:22,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:22,979 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 302 treesize of output 278 [2024-11-09 01:27:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:27:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381819395] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12, 9] total 31 [2024-11-09 01:27:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939239660] [2024-11-09 01:27:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:25,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:27:25,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:27:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:27:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=777, Unknown=4, NotChecked=58, Total=992 [2024-11-09 01:27:25,367 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:27:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:29,784 INFO L93 Difference]: Finished difference Result 195 states and 272 transitions. [2024-11-09 01:27:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:27:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-09 01:27:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:29,788 INFO L225 Difference]: With dead ends: 195 [2024-11-09 01:27:29,788 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:27:29,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 428 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=4, NotChecked=64, Total=1190 [2024-11-09 01:27:29,790 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 278 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:29,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 495 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 01:27:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:27:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-09 01:27:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:27:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2024-11-09 01:27:29,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 107 [2024-11-09 01:27:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2024-11-09 01:27:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:27:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-09 01:27:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:27:29,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:29,815 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:29,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:30,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:30,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:30,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:30,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:30,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 24284034, now seen corresponding path program 1 times [2024-11-09 01:27:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:27:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068818785] [2024-11-09 01:27:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:30,418 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 01:27:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:27:30,419 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:27:30,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:27:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 01:27:35,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:37,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:37,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 40 [2024-11-09 01:27:41,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:41,088 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 1 case distinctions, treesize of input 125 treesize of output 69 [2024-11-09 01:27:45,499 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 164 treesize of output 131 [2024-11-09 01:27:47,866 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 164 treesize of output 131 [2024-11-09 01:27:49,945 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 164 treesize of output 131 [2024-11-09 01:27:52,770 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 164 treesize of output 131 [2024-11-09 01:27:54,842 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 164 treesize of output 131 [2024-11-09 01:27:56,746 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 208 treesize of output 163 [2024-11-09 01:28:21,533 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 69 DAG size of output: 67 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:31,161 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 162 treesize of output 124 [2024-11-09 01:28:33,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:33,591 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 48 treesize of output 24 [2024-11-09 01:28:55,747 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:29:00,499 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 99 treesize of output 77 [2024-11-09 01:29:21,726 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:29:21,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 61 [2024-11-09 01:29:42,051 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:29:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 01:29:42,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:30,175 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (fp.leq c_~last_1_var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_293))) (fp.sub c_currentRoundingMode (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 01:30:33,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (fp.leq c_~last_1_var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base v_ArrVal_292) c_~var_1_12_Pointer~0.base v_ArrVal_293))) (fp.sub c_currentRoundingMode (let ((.cse0 (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select (select .cse1 c_~var_1_4_Pointer~0.base) c_~var_1_4_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-09 01:31:38,343 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:32:16,085 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:32:23,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:32:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068818785] [2024-11-09 01:32:23,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068818785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:32:23,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1842539636] [2024-11-09 01:32:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:32:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:32:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:32:23,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:32:23,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-09 01:32:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:32:25,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:32:25,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:32:35,595 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 12 treesize of output 8 [2024-11-09 01:32:44,210 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 17 treesize of output 12 [2024-11-09 01:32:53,710 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 17 treesize of output 12 [2024-11-09 01:33:01,529 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 17 treesize of output 12 [2024-11-09 01:33:08,642 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 17 treesize of output 12 [2024-11-09 01:33:16,067 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 26 treesize of output 21 [2024-11-09 01:33:22,004 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 30 treesize of output 26 [2024-11-09 01:33:28,161 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 30 treesize of output 26 [2024-11-09 01:33:35,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2024-11-09 01:33:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 01:33:58,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:32,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_1_Pointer~0.offset (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset))))) c_~var_1_7_Pointer~0.base v_ArrVal_322) c_~var_1_12_Pointer~0.base v_ArrVal_323))) (= ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset))) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset)))))) is different from false [2024-11-09 01:34:32,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1842539636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755897940] [2024-11-09 01:34:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:32,527 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:32,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 01:34:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:34,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:34:34,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:58,485 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 17 treesize of output 17 [2024-11-09 01:35:05,344 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 22 treesize of output 20 [2024-11-09 01:35:11,447 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 22 treesize of output 20 [2024-11-09 01:35:17,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2024-11-09 01:35:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:35:17,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:44,199 INFO L349 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2024-11-09 01:35:44,199 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2024-11-09 01:35:44,247 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-09 01:35:44,247 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 1412 treesize of output 1276 [2024-11-09 01:35:44,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:44,318 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 318 treesize of output 310 [2024-11-09 01:35:44,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:44,384 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 302 treesize of output 278 [2024-11-09 01:35:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:35:56,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755897940] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:56,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:35:56,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [27, 13, 10] total 54 [2024-11-09 01:35:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948122826] [2024-11-09 01:35:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:35:56,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:35:56,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:35:56,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:35:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3041, Unknown=41, NotChecked=342, Total=3660 [2024-11-09 01:35:56,804 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:36:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:26,786 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2024-11-09 01:36:26,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:36:26,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-09 01:36:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:26,790 INFO L225 Difference]: With dead ends: 197 [2024-11-09 01:36:26,791 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:36:26,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 413 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 435.0s TimeCoverageRelationStatistics Valid=268, Invalid=3483, Unknown=43, NotChecked=366, Total=4160 [2024-11-09 01:36:26,794 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 265 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:26,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 574 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 01:36:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:36:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-09 01:36:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:36:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2024-11-09 01:36:26,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 109 [2024-11-09 01:36:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:26,807 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2024-11-09 01:36:26,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:36:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-09 01:36:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:26,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:26,810 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:26,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:27,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:27,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 01:36:27,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1432152134, now seen corresponding path program 1 times [2024-11-09 01:36:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197275510] [2024-11-09 01:36:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:27,413 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 01:36:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:27,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:27,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:27,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:36:27,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:36:27,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:36:27,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197275510] [2024-11-09 01:36:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197275510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:36:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:36:27,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:36:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465139303] [2024-11-09 01:36:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:36:27,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:36:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:36:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:36:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:36:27,945 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:36:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:28,017 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2024-11-09 01:36:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:36:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-09 01:36:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:28,020 INFO L225 Difference]: With dead ends: 192 [2024-11-09 01:36:28,020 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 01:36:28,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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 01:36:28,021 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:28,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:36:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 01:36:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 01:36:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:36:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-09 01:36:28,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 110 [2024-11-09 01:36:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:28,033 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-09 01:36:28,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:36:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-09 01:36:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:36:28,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:28,035 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:36:28,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:28,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:28,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:36:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2112210504, now seen corresponding path program 1 times [2024-11-09 01:36:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:36:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669609231] [2024-11-09 01:36:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:28,237 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 01:36:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:36:28,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:28,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:36:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:29,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:36:29,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:38,532 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 97 treesize of output 70 [2024-11-09 01:36:38,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 152 treesize of output 94 [2024-11-09 01:36:39,457 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 160 treesize of output 122 [2024-11-09 01:36:40,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:40,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 134 [2024-11-09 01:36:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:36:40,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:41,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_100| (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_100|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_100|))) c_~var_1_12_Pointer~0.base v_ArrVal_397))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_100|)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-09 01:36:42,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_100| (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_393))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_7_Pointer~0.base (store (store (select .cse7 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_100|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_100|))) c_~var_1_12_Pointer~0.base v_ArrVal_397))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_100|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_100|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 01:36:42,509 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:36:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669609231] [2024-11-09 01:36:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669609231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802005711] [2024-11-09 01:36:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:42,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:36:42,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:36:42,511 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:36:42,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-09 01:36:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:45,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 01:36:45,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:54,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:36:57,819 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 113 treesize of output 82 [2024-11-09 01:36:58,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 166 treesize of output 100 [2024-11-09 01:36:59,565 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 147 treesize of output 123 [2024-11-09 01:37:00,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 151 [2024-11-09 01:37:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:37:01,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:37:01,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_424))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset)) (select .cse1 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:37:01,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_107| (_ BitVec 64)) (v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_107|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_107|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_107|)) (let ((.cse0 (let ((.cse1 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse5 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset))) (let ((.cse6 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_107|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_107|))) c_~var_1_12_Pointer~0.base v_ArrVal_424))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse6 c_~var_1_7_Pointer~0.base))) (concat (select .cse4 .cse5) (select .cse4 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) (let ((.cse7 (let ((.cse8 (select .cse6 c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-09 01:37:01,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_107| (_ BitVec 64)) (v_ArrVal_424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_421))) (or (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset))) (let ((.cse3 (store (store .cse7 c_~var_1_7_Pointer~0.base (store (store (select .cse7 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_107|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_107|))) c_~var_1_12_Pointer~0.base v_ArrVal_424))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_107|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_107|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_107|))))))) is different from false [2024-11-09 01:37:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802005711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:37:01,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5815915] [2024-11-09 01:37:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:37:01,894 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:37:01,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 01:37:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:04,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 01:37:04,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:12,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 01:37:13,572 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 97 treesize of output 70 [2024-11-09 01:37:13,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 152 treesize of output 94 [2024-11-09 01:37:14,185 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 160 treesize of output 122 [2024-11-09 01:37:14,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:14,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 134 [2024-11-09 01:37:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 68 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:37:14,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:37:15,989 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_113| (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_113|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_113|))) c_~var_1_12_Pointer~0.base v_ArrVal_397))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_113|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_113|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_113|)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-09 01:37:16,278 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_113| (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_450))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_7_Pointer~0.base (store (store (select .cse7 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_113|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_113|))) c_~var_1_12_Pointer~0.base v_ArrVal_397))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_113|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_113|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_113|))))))) is different from false [2024-11-09 01:37:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5815915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:37:16,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:37:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 22 [2024-11-09 01:37:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417355447] [2024-11-09 01:37:16,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:37:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 01:37:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:37:16,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 01:37:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=670, Unknown=18, NotChecked=406, Total=1190 [2024-11-09 01:37:16,637 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 4 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:37:29,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:37:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:45,936 INFO L93 Difference]: Finished difference Result 258 states and 355 transitions. [2024-11-09 01:37:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:37:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 4 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 110 [2024-11-09 01:37:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:45,939 INFO L225 Difference]: With dead ends: 258 [2024-11-09 01:37:45,939 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 01:37:45,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 357 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=239, Invalid=1411, Unknown=18, NotChecked=588, Total=2256 [2024-11-09 01:37:45,941 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 666 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:45,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 648 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2024-11-09 01:37:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 01:37:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2024-11-09 01:37:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3445378151260505) internal successors, (160), 119 states have internal predecessors, (160), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 01:37:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 186 transitions. [2024-11-09 01:37:45,963 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 186 transitions. Word has length 110 [2024-11-09 01:37:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:45,964 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 186 transitions. [2024-11-09 01:37:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 22 states have internal predecessors, (108), 4 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-09 01:37:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 186 transitions. [2024-11-09 01:37:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 01:37:45,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:45,967 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:45,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-09 01:37:46,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:46,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:46,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:46,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:46,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash -796553398, now seen corresponding path program 1 times [2024-11-09 01:37:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:37:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346483453] [2024-11-09 01:37:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:46,570 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 01:37:46,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:37:46,571 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:46,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:47,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:37:47,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:37:47,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:37:47,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:37:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346483453] [2024-11-09 01:37:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346483453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:37:47,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:37:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:37:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143024844] [2024-11-09 01:37:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:37:47,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:37:47,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:37:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:37:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:37:47,177 INFO L87 Difference]: Start difference. First operand 135 states and 186 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:37:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:47,364 INFO L93 Difference]: Finished difference Result 267 states and 369 transitions. [2024-11-09 01:37:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:37:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-09 01:37:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:47,367 INFO L225 Difference]: With dead ends: 267 [2024-11-09 01:37:47,367 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 01:37:47,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 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 01:37:47,369 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:47,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:37:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 01:37:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 01:37:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 01:37:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2024-11-09 01:37:47,389 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 110 [2024-11-09 01:37:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:47,389 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2024-11-09 01:37:47,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:37:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2024-11-09 01:37:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:37:47,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:47,392 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:37:47,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:47,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:37:47,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1523012014, now seen corresponding path program 1 times [2024-11-09 01:37:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 01:37:47,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711888979] [2024-11-09 01:37:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:47,594 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 01:37:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 01:37:47,596 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:47,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/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 01:37:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:48,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 01:37:48,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:58,517 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 95 treesize of output 68 [2024-11-09 01:37:58,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 150 treesize of output 92 [2024-11-09 01:37:59,506 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 158 treesize of output 120 [2024-11-09 01:38:00,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:38:00,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 132 [2024-11-09 01:38:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:38:00,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:38:01,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_501))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset)) (select .cse1 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (let ((.cse4 (select .cse2 c_~var_1_11_Pointer~0.base))) (concat (select .cse4 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (select .cse4 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) is different from false [2024-11-09 01:38:01,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_124| (_ BitVec 64)) (v_ArrVal_501 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_124|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_124|))) c_~var_1_12_Pointer~0.base v_ArrVal_501))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_124|)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-09 01:38:01,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_124| (_ BitVec 64)) (v_ArrVal_501 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_499))) (or (let ((.cse2 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_7_Pointer~0.base (store (store (select .cse7 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_124|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_124|))) c_~var_1_12_Pointer~0.base v_ArrVal_501))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_124|)) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8)))))))) is different from false [2024-11-09 01:38:02,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 01:38:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711888979] [2024-11-09 01:38:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711888979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:38:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [470493246] [2024-11-09 01:38:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:02,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:38:02,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 01:38:02,682 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:38:02,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 01:38:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:05,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 01:38:05,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:38:14,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:38:21,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-09 01:38:22,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 164 treesize of output 98 [2024-11-09 01:38:23,229 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 41 treesize of output 35 [2024-11-09 01:38:24,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 81 [2024-11-09 01:38:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 01:38:24,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:38:25,836 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_131| (_ BitVec 64)) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset))) (let ((.cse3 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_131|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_131|))) c_~var_1_12_Pointer~0.base v_ArrVal_529))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_131|)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse6) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-09 01:38:26,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_131| (_ BitVec 64)) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_526))) (or (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_7_Pointer~0.offset))) (let ((.cse3 (store (store .cse7 c_~var_1_7_Pointer~0.base (store (store (select .cse7 c_~var_1_7_Pointer~0.base) c_~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_131|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_131|))) c_~var_1_12_Pointer~0.base v_ArrVal_529))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_7_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse4 (let ((.cse5 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (not (= (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse6) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_131|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_131|))))))) is different from false [2024-11-09 01:38:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [470493246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:38:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37206480] [2024-11-09 01:38:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:27,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:38:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:38:27,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:38:27,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb86de2d-ecfe-4e6b-aee8-03f5f6c08509/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 01:38:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:29,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 01:38:29,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:38:38,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 01:39:18,092 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 111 treesize of output 80 [2024-11-09 01:39:22,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 166 treesize of output 100 [2024-11-09 01:39:23,466 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 158 treesize of output 120 [2024-11-09 01:39:24,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:39:24,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 132 [2024-11-09 01:39:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 68 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 01:39:24,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:25,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_138| (_ BitVec 64)) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_138|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_138|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_138|)) (let ((.cse0 (let ((.cse1 (select |c_#memory_int| c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse5 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse6 (store (store |c_#memory_int| c_~var_1_7_Pointer~0.base (store (store (select |c_#memory_int| c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_138|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_138|))) c_~var_1_12_Pointer~0.base v_ArrVal_529))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse6 c_~var_1_7_Pointer~0.base))) (concat (select .cse4 .cse5) (select .cse4 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) (let ((.cse7 (let ((.cse8 (select .cse6 c_~var_1_11_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-09 01:39:26,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_553 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_138| (_ BitVec 64)) (v_ArrVal_529 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_7_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_553))) (or (not (= (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_138|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_138|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_138|)))) (let ((.cse6 (bvadd ~var_1_7_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_7_Pointer~0.base (store (store (select .cse3 c_~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_138|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_138|))) c_~var_1_12_Pointer~0.base v_ArrVal_529))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_7_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_7_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-09 01:39:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37206480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:27,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:39:27,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 18] total 38 [2024-11-09 01:39:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377051299] [2024-11-09 01:39:27,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:39:27,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 01:39:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 01:39:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 01:39:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1881, Unknown=56, NotChecked=672, Total=2862 [2024-11-09 01:39:27,153 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 39 states, 36 states have (on average 3.5277777777777777) internal successors, (127), 35 states have internal predecessors, (127), 5 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-09 01:39:29,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:32,658 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 [0] [2024-11-09 01:39:34,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:36,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:38,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:40,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:42,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:45,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:47,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:49,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:51,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:53,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:55,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:57,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:39:59,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:01,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:03,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:05,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:07,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:09,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:15,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:17,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:24,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:26,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:28,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:30,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:32,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:34,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:36,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:38,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:40,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:42,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:44,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:46,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:49,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:51,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:53,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:55,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:57,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:40:59,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:01,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:03,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:05,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:07,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:09,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:11,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:13,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:15,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:41:22,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]