./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh --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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:30:56,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:30:57,022 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:30:57,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:30:57,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:30:57,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:30:57,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:30:57,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:30:57,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:30:57,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:30:57,051 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:30:57,051 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:30:57,052 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:30:57,052 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:30:57,053 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:30:57,053 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:30:57,054 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:30:57,054 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:30:57,055 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:30:57,055 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:30:57,056 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:30:57,059 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:30:57,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:30:57,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:30:57,061 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:30:57,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:30:57,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:30:57,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:30:57,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:30:57,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:30:57,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:30:57,063 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:30:57,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:30:57,064 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:30:57,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:30:57,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:30:57,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:30:57,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:30:57,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:30:57,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:30:57,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:30:57,066 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:30:57,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:30:57,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:30:57,066 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:30:57,066 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:30:57,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:30:57,067 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_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/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_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh 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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2023-12-02 18:30:57,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:30:57,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:30:57,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:30:57,281 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:30:57,282 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:30:57,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:30:59,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:31:00,137 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:31:00,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:31:00,147 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/fcaec55f0/c0aef34f65cf41058aefd91148b14fbe/FLAG26b00e9e2 [2023-12-02 18:31:00,159 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/fcaec55f0/c0aef34f65cf41058aefd91148b14fbe [2023-12-02 18:31:00,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:31:00,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:31:00,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:31:00,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:31:00,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:31:00,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103cfa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00, skipping insertion in model container [2023-12-02 18:31:00,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:31:00,346 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2023-12-02 18:31:00,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:31:00,398 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:31:00,410 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2023-12-02 18:31:00,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:31:00,446 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:31:00,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00 WrapperNode [2023-12-02 18:31:00,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:31:00,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:31:00,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:31:00,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:31:00,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,491 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 320 [2023-12-02 18:31:00,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:31:00,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:31:00,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:31:00,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:31:00,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:31:00,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:31:00,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:31:00,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:31:00,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (1/1) ... [2023-12-02 18:31:00,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:31:00,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:31:00,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:31:00,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 18:31:00,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 18:31:00,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:31:00,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:31:00,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:31:00,732 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:31:00,734 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:31:01,094 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:31:01,528 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:31:01,529 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 18:31:01,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:01 BoogieIcfgContainer [2023-12-02 18:31:01,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:31:01,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:31:01,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:31:01,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:31:01,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:31:00" (1/3) ... [2023-12-02 18:31:01,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c6744b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:01, skipping insertion in model container [2023-12-02 18:31:01,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:00" (2/3) ... [2023-12-02 18:31:01,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c6744b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:01, skipping insertion in model container [2023-12-02 18:31:01,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:01" (3/3) ... [2023-12-02 18:31:01,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:31:01,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:31:01,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:31:01,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:31:01,611 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@127361a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:31:01,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:31:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:31:01,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:01,624 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:01,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:01,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash -343570485, now seen corresponding path program 1 times [2023-12-02 18:31:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:31:01,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672010440] [2023-12-02 18:31:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:31:01,807 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 18:31:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399977406] [2023-12-02 18:31:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:31:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:31:01,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:31:01,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:31:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:31:02,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 18:31:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:31:02,931 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 18:31:02,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 18:31:02,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 18:31:02,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:31:03,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 18:31:03,141 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 18:31:03,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:31:03,195 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-12-02 18:31:03,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated [2023-12-02 18:31:03,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-12-02 18:31:03,200 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-12-02 18:31:03,201 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-12-02 18:31:03,204 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-12-02 18:31:03,205 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-12-02 18:31:03,207 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-12-02 18:31:03,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-12-02 18:31:03,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-12-02 18:31:03,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-12-02 18:31:03,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short39 could not be translated [2023-12-02 18:31:03,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-12-02 18:31:03,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 18:31:03,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short40 could not be translated [2023-12-02 18:31:03,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-12-02 18:31:03,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short40 could not be translated [2023-12-02 18:31:03,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-12-02 18:31:03,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-12-02 18:31:03,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short39 could not be translated [2023-12-02 18:31:03,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-12-02 18:31:03,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated [2023-12-02 18:31:03,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:31:03 BoogieIcfgContainer [2023-12-02 18:31:03,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:31:03,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:31:03,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:31:03,235 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:31:03,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:01" (3/4) ... [2023-12-02 18:31:03,237 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 18:31:03,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:31:03,239 INFO L158 Benchmark]: Toolchain (without parser) took 3075.45ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 104.5MB in the beginning and 123.0MB in the end (delta: -18.5MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,239 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:31:03,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.36ms. Allocated memory is still 140.5MB. Free memory was 104.5MB in the beginning and 91.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,242 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 140.5MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,242 INFO L158 Benchmark]: RCFGBuilder took 993.70ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 95.1MB in the end (delta: -9.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,243 INFO L158 Benchmark]: TraceAbstraction took 1701.04ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 95.1MB in the beginning and 123.0MB in the end (delta: -27.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2023-12-02 18:31:03,244 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 169.9MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:31:03,247 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.36ms. Allocated memory is still 140.5MB. Free memory was 104.5MB in the beginning and 91.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.22ms. Allocated memory is still 140.5MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 140.5MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 993.70ms. Allocated memory is still 140.5MB. Free memory was 86.1MB in the beginning and 95.1MB in the end (delta: -9.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1701.04ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 95.1MB in the beginning and 123.0MB in the end (delta: -27.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 169.9MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short36 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of shiftLeft at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 4; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_7 = 0; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] signed short int var_1_8 = 100; [L29] signed short int* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 32; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] double var_1_10 = 9.2; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 0.975; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] signed short int var_1_12 = 1; [L37] signed short int* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_14 = -16; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char last_1_var_1_1 = 10; [L41] double last_1_var_1_10 = 9.2; [L42] signed short int last_1_var_1_12 = 1; [L43] signed long int last_1_var_1_14 = -16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] 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 ) [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F [L81] 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_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] 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_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) [L81] 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_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; [L48] COND TRUE ((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0 [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR (((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1) [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR (((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1) [L49] (*(var_1_12_Pointer)) = (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))) [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) [L54] EXPR 10 << (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) [L54] COND TRUE (10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_12_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_8_Pointer)) = ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) [L59] COND FALSE !((*(var_1_12_Pointer)) <= 16) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L62] EXPR \read(*var_1_10_Pointer) [L62] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L62] EXPR \read(*var_1_10_Pointer) [L62] COND TRUE (((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] COND TRUE (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_3_Pointer) [L64] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR ((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR ((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR 10 << (*(var_1_12_Pointer)) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR \read(*var_1_9_Pointer) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_11_Pointer) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR (((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12: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_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 1, TraceHistogramMax: 5, 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=19occurred 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, 0.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 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 [2023-12-02 18:31:03,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh --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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:31:05,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:31:05,298 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 18:31:05,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:31:05,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:31:05,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:31:05,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:31:05,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:31:05,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:31:05,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:31:05,329 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:31:05,330 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:31:05,330 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:31:05,331 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:31:05,331 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:31:05,332 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:31:05,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:31:05,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:31:05,334 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:31:05,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:31:05,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:31:05,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:31:05,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:31:05,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:31:05,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:31:05,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:31:05,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:31:05,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:31:05,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:31:05,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:31:05,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:31:05,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:31:05,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:31:05,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:31:05,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:31:05,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:31:05,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:31:05,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:31:05,341 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:31:05,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:31:05,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:31:05,342 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:31:05,342 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:31:05,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:31:05,342 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/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_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh 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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2023-12-02 18:31:05,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:31:05,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:31:05,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:31:05,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:31:05,652 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:31:05,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:31:08,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:31:08,566 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:31:08,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:31:08,576 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/6fc107738/5ac55800fe1c44bbb9d9802e4cfd8fcf/FLAGd0124ad6b [2023-12-02 18:31:08,590 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/data/6fc107738/5ac55800fe1c44bbb9d9802e4cfd8fcf [2023-12-02 18:31:08,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:31:08,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:31:08,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:31:08,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:31:08,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:31:08,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52551091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08, skipping insertion in model container [2023-12-02 18:31:08,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,629 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:31:08,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2023-12-02 18:31:08,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:31:08,834 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:31:08,847 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2023-12-02 18:31:08,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:31:08,905 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:31:08,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08 WrapperNode [2023-12-02 18:31:08,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:31:08,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:31:08,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:31:08,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:31:08,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,963 INFO L138 Inliner]: procedures = 36, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 311 [2023-12-02 18:31:08,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:31:08,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:31:08,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:31:08,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:31:08,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:08,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:09,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:09,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:09,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:09,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:31:09,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:31:09,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:31:09,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:31:09,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (1/1) ... [2023-12-02 18:31:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:31:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:31:09,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:31:09,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-12-02 18:31:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:31:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 18:31:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-12-02 18:31:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 18:31:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-12-02 18:31:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 18:31:09,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 18:31:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:31:09,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:31:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 18:31:09,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-12-02 18:31:09,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 18:31:09,200 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:31:09,202 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:31:09,724 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:31:09,779 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:31:09,779 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 18:31:09,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:09 BoogieIcfgContainer [2023-12-02 18:31:09,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:31:09,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:31:09,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:31:09,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:31:09,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:31:08" (1/3) ... [2023-12-02 18:31:09,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6345a9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:09, skipping insertion in model container [2023-12-02 18:31:09,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:31:08" (2/3) ... [2023-12-02 18:31:09,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6345a9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:31:09, skipping insertion in model container [2023-12-02 18:31:09,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:09" (3/3) ... [2023-12-02 18:31:09,788 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2023-12-02 18:31:09,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:31:09,806 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:31:09,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:31:09,860 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@9aaf80d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:31:09,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:31:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:31:09,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:09,874 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:09,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:09,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -269528693, now seen corresponding path program 1 times [2023-12-02 18:31:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841711415] [2023-12-02 18:31:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:09,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:09,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 18:31:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:10,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-02 18:31:10,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 18:31:10,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:31:10,165 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841711415] [2023-12-02 18:31:10,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841711415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:31:10,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:31:10,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:31:10,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289971194] [2023-12-02 18:31:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:31:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 18:31:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:10,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 18:31:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:31:10,201 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:31:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:31:10,248 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2023-12-02 18:31:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 18:31:10,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-12-02 18:31:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:31:10,258 INFO L225 Difference]: With dead ends: 123 [2023-12-02 18:31:10,258 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 18:31:10,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 18:31:10,265 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:31:10,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:31:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 18:31:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-02 18:31:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-12-02 18:31:10,317 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2023-12-02 18:31:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:31:10,317 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-12-02 18:31:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:31:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-12-02 18:31:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:31:10,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:10,321 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:10,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:31:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:10,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:10,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 838571601, now seen corresponding path program 1 times [2023-12-02 18:31:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098977674] [2023-12-02 18:31:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:10,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:10,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 18:31:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:10,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:31:10,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:31:10,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:31:10,814 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098977674] [2023-12-02 18:31:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098977674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:31:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:31:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:31:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538182547] [2023-12-02 18:31:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:31:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:31:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:31:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:31:10,818 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:31:10,898 INFO L93 Difference]: Finished difference Result 145 states and 208 transitions. [2023-12-02 18:31:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:31:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 18:31:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:31:10,901 INFO L225 Difference]: With dead ends: 145 [2023-12-02 18:31:10,901 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 18:31:10,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:31:10,904 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:31:10,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:31:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 18:31:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-12-02 18:31:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-12-02 18:31:10,914 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2023-12-02 18:31:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:31:10,916 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-12-02 18:31:10,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-12-02 18:31:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:31:10,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:10,919 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:10,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 18:31:11,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:11,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:11,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 445544591, now seen corresponding path program 1 times [2023-12-02 18:31:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411155871] [2023-12-02 18:31:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:11,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:11,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 18:31:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:11,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:31:11,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:31:11,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:31:11,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411155871] [2023-12-02 18:31:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411155871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:31:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:31:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:31:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670122981] [2023-12-02 18:31:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:31:11,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:31:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:31:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:31:11,368 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:31:11,471 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2023-12-02 18:31:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:31:11,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 18:31:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:31:11,474 INFO L225 Difference]: With dead ends: 156 [2023-12-02 18:31:11,474 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 18:31:11,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:31:11,476 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 69 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:31:11,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 342 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:31:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 18:31:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2023-12-02 18:31:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2023-12-02 18:31:11,486 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2023-12-02 18:31:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:31:11,487 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2023-12-02 18:31:11,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2023-12-02 18:31:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:31:11,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:11,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:11,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 18:31:11,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:11,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:11,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -363802035, now seen corresponding path program 1 times [2023-12-02 18:31:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189940215] [2023-12-02 18:31:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:11,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:11,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 18:31:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:11,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:31:11,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:31:11,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:31:11,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189940215] [2023-12-02 18:31:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189940215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:31:11,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:31:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 18:31:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783157850] [2023-12-02 18:31:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:31:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:31:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:31:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:31:11,947 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:31:12,143 INFO L93 Difference]: Finished difference Result 150 states and 209 transitions. [2023-12-02 18:31:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 18:31:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 18:31:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:31:12,145 INFO L225 Difference]: With dead ends: 150 [2023-12-02 18:31:12,145 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 18:31:12,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-02 18:31:12,147 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:31:12,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 446 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:31:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 18:31:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2023-12-02 18:31:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2023-12-02 18:31:12,156 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 55 [2023-12-02 18:31:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:31:12,156 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2023-12-02 18:31:12,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2023-12-02 18:31:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:31:12,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:12,158 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:12,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 18:31:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:12,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:12,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -363742453, now seen corresponding path program 1 times [2023-12-02 18:31:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58750047] [2023-12-02 18:31:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:12,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:12,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 18:31:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:12,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 18:31:12,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:13,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:13,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:14,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:14,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:14,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:14,307 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 13 treesize of output 1 [2023-12-02 18:31:14,336 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 [2023-12-02 18:31:14,406 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 [2023-12-02 18:31:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 18:31:14,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:31:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:31:14,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58750047] [2023-12-02 18:31:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58750047] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 18:31:14,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:31:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-02 18:31:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855322734] [2023-12-02 18:31:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:31:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:31:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:31:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-02 18:31:14,537 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:31:14,976 INFO L93 Difference]: Finished difference Result 161 states and 221 transitions. [2023-12-02 18:31:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:31:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-02 18:31:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:31:14,977 INFO L225 Difference]: With dead ends: 161 [2023-12-02 18:31:14,977 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 18:31:14,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:31:14,979 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:31:14,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 207 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:31:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 18:31:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2023-12-02 18:31:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 18:31:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2023-12-02 18:31:14,987 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 55 [2023-12-02 18:31:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:31:14,987 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2023-12-02 18:31:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:31:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2023-12-02 18:31:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 18:31:14,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:31:14,989 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:31:14,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 18:31:15,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:15,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:31:15,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:31:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2121878124, now seen corresponding path program 1 times [2023-12-02 18:31:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:31:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151323973] [2023-12-02 18:31:15,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:31:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:31:15,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:31:15,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 18:31:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:15,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 18:31:15,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:31:17,787 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 [2023-12-02 18:31:17,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2023-12-02 18:31:18,009 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 [2023-12-02 18:31:18,102 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 157 treesize of output 118 [2023-12-02 18:31:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-12-02 18:31:18,298 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 [2023-12-02 18:31:18,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:31:18,833 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 321 treesize of output 131 [2023-12-02 18:31:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:31:18,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:31:19,120 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_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 [2023-12-02 18:31:19,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_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_9_Pointer~0.base v_ArrVal_134))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (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))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:19,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_133) c_~var_1_9_Pointer~0.base v_ArrVal_134))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))))) is different from false [2023-12-02 18:31:19,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_132 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_132) c_~var_1_8_Pointer~0.base v_ArrVal_133) c_~var_1_9_Pointer~0.base v_ArrVal_134))) (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_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:19,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_132 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_138 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_131) c_~var_1_14_Pointer~0.base v_ArrVal_132) c_~var_1_8_Pointer~0.base v_ArrVal_133) c_~var_1_9_Pointer~0.base v_ArrVal_134))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) c_~var_1_1_Pointer~0.base v_ArrVal_138))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|))))))) is different from false [2023-12-02 18:31:19,761 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:31:19,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151323973] [2023-12-02 18:31:19,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151323973] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:31:19,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1292117474] [2023-12-02 18:31:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:31:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:31:19,763 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:31:19,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-02 18:31:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:20,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 18:31:20,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:22,044 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 [2023-12-02 18:31:23,579 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 [2023-12-02 18:31:23,777 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 [2023-12-02 18:31:23,943 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 [2023-12-02 18:31:24,109 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 171 treesize of output 128 [2023-12-02 18:31:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2023-12-02 18:31:24,327 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 174 treesize of output 132 [2023-12-02 18:31:24,986 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 323 treesize of output 139 [2023-12-02 18:31:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:31:25,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:31:25,397 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_9_Pointer~0.base v_ArrVal_164))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|)) (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))))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_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 [2023-12-02 18:31:25,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_163) c_~var_1_9_Pointer~0.base v_ArrVal_164))) (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_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|)))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_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 [2023-12-02 18:31:25,644 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_162) c_~var_1_8_Pointer~0.base v_ArrVal_163) c_~var_1_9_Pointer~0.base v_ArrVal_164))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|)) (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))))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_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 [2023-12-02 18:31:26,049 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_161) c_~var_1_14_Pointer~0.base v_ArrVal_162) c_~var_1_8_Pointer~0.base v_ArrVal_163) c_~var_1_9_Pointer~0.base v_ArrVal_164))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_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_32|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_32|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_32|))))))) is different from false [2023-12-02 18:31:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1292117474] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:31:26,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627102838] [2023-12-02 18:31:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:31:26,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:31:26,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:31:26,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:31:26,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:31:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:31:26,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 18:31:26,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:31:27,773 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 19 treesize of output 8 [2023-12-02 18:31:37,176 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 105 treesize of output 76 [2023-12-02 18:31:41,385 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 105 treesize of output 76 [2023-12-02 18:31:47,598 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 105 treesize of output 76 [2023-12-02 18:31:55,782 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 138 [2023-12-02 18:31:55,788 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 172 treesize of output 137 [2023-12-02 18:31:55,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-12-02 18:31:55,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-02 18:31:55,926 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 [2023-12-02 18:31:56,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:31:56,333 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 321 treesize of output 131 [2023-12-02 18:31:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:31:56,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:31:56,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_194 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (~var_1_10_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_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_194)))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) (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))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:57,000 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_194 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_194))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) (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))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:57,129 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_194 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_191) c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_194))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) (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))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:57,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_194 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_192 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_190 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_190) c_~var_1_14_Pointer~0.base v_ArrVal_191) c_~var_1_8_Pointer~0.base v_ArrVal_192))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_194))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) (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))))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) c_~var_1_1_Pointer~0.base v_ArrVal_167))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:31:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627102838] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:31:57,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:31:57,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-12-02 18:31:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735293405] [2023-12-02 18:31:57,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:31:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 18:31:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:31:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 18:31:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=903, Unknown=43, NotChecked=962, Total=2070 [2023-12-02 18:31:57,659 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 18:32:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:03,213 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2023-12-02 18:32:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:32:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 57 [2023-12-02 18:32:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:03,216 INFO L225 Difference]: With dead ends: 205 [2023-12-02 18:32:03,216 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 18:32:03,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=305, Invalid=1343, Unknown=44, NotChecked=1170, Total=2862 [2023-12-02 18:32:03,218 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 394 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:03,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 555 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 18:32:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 18:32:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2023-12-02 18:32:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 18:32:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2023-12-02 18:32:03,240 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 57 [2023-12-02 18:32:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:03,241 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2023-12-02 18:32:03,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 18:32:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2023-12-02 18:32:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 18:32:03,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:03,243 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:03,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 18:32:03,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-02 18:32:03,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 18:32:03,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:32:03,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:03,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:03,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1363742546, now seen corresponding path program 1 times [2023-12-02 18:32:03,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:03,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772355984] [2023-12-02 18:32:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:03,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:03,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:03,846 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:03,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 18:32:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:04,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 18:32:04,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:04,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-02 18:32:04,287 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 [2023-12-02 18:32:04,305 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 [2023-12-02 18:32:04,349 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 34 treesize of output 22 [2023-12-02 18:32:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:04,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:04,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772355984] [2023-12-02 18:32:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772355984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:04,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:32:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128082495] [2023-12-02 18:32:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:32:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:32:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:32:04,368 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:04,799 INFO L93 Difference]: Finished difference Result 223 states and 307 transitions. [2023-12-02 18:32:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:32:04,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 18:32:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:04,801 INFO L225 Difference]: With dead ends: 223 [2023-12-02 18:32:04,801 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 18:32:04,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:32:04,802 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 166 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:04,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 170 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:32:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 18:32:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-12-02 18:32:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 18:32:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2023-12-02 18:32:04,811 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 57 [2023-12-02 18:32:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2023-12-02 18:32:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2023-12-02 18:32:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 18:32:04,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:04,812 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:04,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-02 18:32:05,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:05,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:05,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash 970715536, now seen corresponding path program 1 times [2023-12-02 18:32:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312121070] [2023-12-02 18:32:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:05,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:05,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:05,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:05,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 18:32:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:05,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 18:32:05,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:05,361 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 17 treesize of output 9 [2023-12-02 18:32:06,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 18:32:06,060 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 28 treesize of output 23 [2023-12-02 18:32:06,130 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 49 treesize of output 39 [2023-12-02 18:32:06,226 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2023-12-02 18:32:06,231 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 47 treesize of output 48 [2023-12-02 18:32:06,298 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 47 treesize of output 48 [2023-12-02 18:32:06,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2023-12-02 18:32:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:06,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:06,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:06,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312121070] [2023-12-02 18:32:06,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312121070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:06,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 18:32:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448635164] [2023-12-02 18:32:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 18:32:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 18:32:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 18:32:06,514 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:08,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:32:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:10,555 INFO L93 Difference]: Finished difference Result 549 states and 741 transitions. [2023-12-02 18:32:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 18:32:10,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 18:32:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:10,557 INFO L225 Difference]: With dead ends: 549 [2023-12-02 18:32:10,558 INFO L226 Difference]: Without dead ends: 440 [2023-12-02 18:32:10,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2023-12-02 18:32:10,559 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 445 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:10,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 464 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 18:32:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-12-02 18:32:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 188. [2023-12-02 18:32:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.3801169590643274) internal successors, (236), 171 states have internal predecessors, (236), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2023-12-02 18:32:10,576 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 57 [2023-12-02 18:32:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:10,576 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2023-12-02 18:32:10,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2023-12-02 18:32:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 18:32:10,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:10,577 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:10,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 18:32:10,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:10,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:10,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash 153067086, now seen corresponding path program 1 times [2023-12-02 18:32:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551989134] [2023-12-02 18:32:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:10,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:10,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 18:32:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:11,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:32:11,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:11,142 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 25 treesize of output 18 [2023-12-02 18:32:11,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 18:32:11,960 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 25 treesize of output 18 [2023-12-02 18:32:12,225 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-12-02 18:32:12,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 18:32:12,325 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:32:12,325 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 36 treesize of output 34 [2023-12-02 18:32:12,580 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:32:12,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 74 [2023-12-02 18:32:12,585 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 62 treesize of output 59 [2023-12-02 18:32:12,688 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 62 treesize of output 59 [2023-12-02 18:32:12,894 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:32:12,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 45 [2023-12-02 18:32:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 18:32:12,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:32:13,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_277 (_ BitVec 32))) (not (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_277)) c_~var_1_10_Pointer~0.base v_ArrVal_275) c_~var_1_1_Pointer~0.base v_ArrVal_278))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))) is different from false [2023-12-02 18:32:14,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_14_Pointer~0.offset (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))) (let ((.cse0 (store |c_#memory_int| c_~var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset .cse1)))) (or (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) .cse1)) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_277 (_ BitVec 32))) (not (let ((.cse2 (store (store (store .cse0 c_~var_1_9_Pointer~0.base (store (select .cse0 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_277)) c_~var_1_10_Pointer~0.base v_ArrVal_275) c_~var_1_1_Pointer~0.base v_ArrVal_278))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse2 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) (select (select .cse2 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))))))) is different from false [2023-12-02 18:32:14,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_14_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_12_Pointer~0.offset (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_277 (_ BitVec 32))) (let ((.cse4 ((_ sign_extend 16) c_~last_1_var_1_12~0))) (let ((.cse2 ((_ sign_extend 16) ((_ extract 15 0) .cse4)))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset .cse4)))) (store .cse3 c_~var_1_14_Pointer~0.base (store (select .cse3 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset .cse2))))) (or (not (let ((.cse0 (store (store (store .cse1 c_~var_1_9_Pointer~0.base (store (select .cse1 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_277)) c_~var_1_10_Pointer~0.base v_ArrVal_275) c_~var_1_1_Pointer~0.base v_ArrVal_278))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (bvmul (select (select .cse0 c_~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset) ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse0 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select (select .cse1 c_~var_1_3_Pointer~0.base) c_~var_1_3_Pointer~0.offset))) .cse2))))))) is different from false [2023-12-02 18:32:14,689 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551989134] [2023-12-02 18:32:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551989134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:32:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1823598272] [2023-12-02 18:32:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:14,689 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:32:14,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:32:14,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:32:14,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-02 18:32:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:15,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 18:32:15,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:15,299 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 17 treesize of output 9 [2023-12-02 18:32:15,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 18:32:16,079 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 28 treesize of output 23 [2023-12-02 18:32:16,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-12-02 18:32:16,521 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 55 treesize of output 52 [2023-12-02 18:32:16,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2023-12-02 18:32:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:16,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1823598272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:32:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-12-02 18:32:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449021597] [2023-12-02 18:32:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:32:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:32:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=411, Unknown=6, NotChecked=132, Total=650 [2023-12-02 18:32:16,843 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:20,021 INFO L93 Difference]: Finished difference Result 464 states and 630 transitions. [2023-12-02 18:32:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:32:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2023-12-02 18:32:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:20,024 INFO L225 Difference]: With dead ends: 464 [2023-12-02 18:32:20,024 INFO L226 Difference]: Without dead ends: 349 [2023-12-02 18:32:20,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=160, Invalid=602, Unknown=6, NotChecked=162, Total=930 [2023-12-02 18:32:20,026 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 238 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:20,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 372 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 519 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 18:32:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-02 18:32:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 226. [2023-12-02 18:32:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.3971291866028708) internal successors, (292), 209 states have internal predecessors, (292), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 316 transitions. [2023-12-02 18:32:20,046 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 316 transitions. Word has length 57 [2023-12-02 18:32:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:20,046 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 316 transitions. [2023-12-02 18:32:20,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 316 transitions. [2023-12-02 18:32:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 18:32:20,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:20,048 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:20,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-12-02 18:32:20,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 18:32:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:20,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:20,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1420278250, now seen corresponding path program 1 times [2023-12-02 18:32:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108261176] [2023-12-02 18:32:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:20,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:20,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:20,450 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:20,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 18:32:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:20,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:32:20,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:32:20,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:20,623 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108261176] [2023-12-02 18:32:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108261176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:32:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097534174] [2023-12-02 18:32:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:32:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:20,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:32:20,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:32:20,624 INFO L87 Difference]: Start difference. First operand 226 states and 316 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:32:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:20,709 INFO L93 Difference]: Finished difference Result 396 states and 551 transitions. [2023-12-02 18:32:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:32:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2023-12-02 18:32:20,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:20,711 INFO L225 Difference]: With dead ends: 396 [2023-12-02 18:32:20,712 INFO L226 Difference]: Without dead ends: 234 [2023-12-02 18:32:20,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:32:20,713 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:20,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 247 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:32:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-02 18:32:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2023-12-02 18:32:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.38755980861244) internal successors, (290), 209 states have internal predecessors, (290), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2023-12-02 18:32:20,728 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 57 [2023-12-02 18:32:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:20,728 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2023-12-02 18:32:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:32:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2023-12-02 18:32:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:20,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:20,729 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:20,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-02 18:32:20,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:20,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:20,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1836731428, now seen corresponding path program 1 times [2023-12-02 18:32:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407146566] [2023-12-02 18:32:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:20,931 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:20,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 18:32:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:21,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 18:32:21,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:21,286 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 17 treesize of output 9 [2023-12-02 18:32:21,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 18:32:22,018 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 28 treesize of output 23 [2023-12-02 18:32:22,093 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 49 treesize of output 39 [2023-12-02 18:32:22,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-12-02 18:32:22,229 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 47 treesize of output 48 [2023-12-02 18:32:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2023-12-02 18:32:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:22,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:22,777 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407146566] [2023-12-02 18:32:22,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407146566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:22,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-02 18:32:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348651915] [2023-12-02 18:32:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:22,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 18:32:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 18:32:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-02 18:32:22,779 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:26,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:32:28,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:32:29,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:32:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:31,691 INFO L93 Difference]: Finished difference Result 391 states and 518 transitions. [2023-12-02 18:32:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 18:32:31,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 18:32:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:31,694 INFO L225 Difference]: With dead ends: 391 [2023-12-02 18:32:31,694 INFO L226 Difference]: Without dead ends: 389 [2023-12-02 18:32:31,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-12-02 18:32:31,695 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 476 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 27 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:31,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 409 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 655 Invalid, 7 Unknown, 0 Unchecked, 8.2s Time] [2023-12-02 18:32:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-02 18:32:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 248. [2023-12-02 18:32:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 231 states have (on average 1.367965367965368) internal successors, (316), 231 states have internal predecessors, (316), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 340 transitions. [2023-12-02 18:32:31,715 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 340 transitions. Word has length 59 [2023-12-02 18:32:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:31,716 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 340 transitions. [2023-12-02 18:32:31,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 340 transitions. [2023-12-02 18:32:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:31,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:31,717 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:31,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 18:32:31,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:31,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:31,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1836791010, now seen corresponding path program 1 times [2023-12-02 18:32:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295025135] [2023-12-02 18:32:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:31,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:31,919 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:31,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 18:32:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:32,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 18:32:32,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:32,251 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 17 treesize of output 9 [2023-12-02 18:32:32,943 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 [2023-12-02 18:32:33,010 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 [2023-12-02 18:32:33,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-12-02 18:32:33,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-12-02 18:32:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-12-02 18:32:33,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2023-12-02 18:32:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:33,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:33,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295025135] [2023-12-02 18:32:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295025135] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 18:32:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250109849] [2023-12-02 18:32:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 18:32:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 18:32:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:32:33,976 INFO L87 Difference]: Start difference. First operand 248 states and 340 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:37,210 INFO L93 Difference]: Finished difference Result 510 states and 677 transitions. [2023-12-02 18:32:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 18:32:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 18:32:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:37,213 INFO L225 Difference]: With dead ends: 510 [2023-12-02 18:32:37,214 INFO L226 Difference]: Without dead ends: 395 [2023-12-02 18:32:37,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2023-12-02 18:32:37,215 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 340 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 31 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:37,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 436 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 668 Invalid, 12 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 18:32:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-12-02 18:32:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 251. [2023-12-02 18:32:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 234 states have (on average 1.3632478632478633) internal successors, (319), 234 states have internal predecessors, (319), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 343 transitions. [2023-12-02 18:32:37,235 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 343 transitions. Word has length 59 [2023-12-02 18:32:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:37,235 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 343 transitions. [2023-12-02 18:32:37,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 343 transitions. [2023-12-02 18:32:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:37,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:37,237 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:37,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:32:37,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:37,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:37,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1646055485, now seen corresponding path program 1 times [2023-12-02 18:32:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:37,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534791066] [2023-12-02 18:32:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:37,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:37,440 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:37,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:32:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:37,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:32:37,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:37,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:32:37,670 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 91 treesize of output 31 [2023-12-02 18:32:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:37,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:37,690 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534791066] [2023-12-02 18:32:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534791066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:37,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:32:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071112738] [2023-12-02 18:32:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:37,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:32:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:32:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:32:37,692 INFO L87 Difference]: Start difference. First operand 251 states and 343 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:37,759 INFO L93 Difference]: Finished difference Result 486 states and 649 transitions. [2023-12-02 18:32:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:32:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 18:32:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:37,761 INFO L225 Difference]: With dead ends: 486 [2023-12-02 18:32:37,762 INFO L226 Difference]: Without dead ends: 314 [2023-12-02 18:32:37,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:32:37,762 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:37,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:32:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-02 18:32:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 251. [2023-12-02 18:32:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 234 states have (on average 1.3376068376068375) internal successors, (313), 234 states have internal predecessors, (313), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 337 transitions. [2023-12-02 18:32:37,776 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 337 transitions. Word has length 59 [2023-12-02 18:32:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:37,777 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 337 transitions. [2023-12-02 18:32:37,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 337 transitions. [2023-12-02 18:32:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:37,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:37,778 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:37,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 18:32:37,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:37,978 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:37,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1060563909, now seen corresponding path program 1 times [2023-12-02 18:32:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936859841] [2023-12-02 18:32:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:37,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:37,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:37,980 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:37,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 18:32:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:38,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 18:32:38,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:38,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 18:32:38,412 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 18 treesize of output 10 [2023-12-02 18:32:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:38,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:38,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936859841] [2023-12-02 18:32:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936859841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:32:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807564799] [2023-12-02 18:32:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:38,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:32:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:32:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:32:38,432 INFO L87 Difference]: Start difference. First operand 251 states and 337 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:40,225 INFO L93 Difference]: Finished difference Result 583 states and 758 transitions. [2023-12-02 18:32:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:32:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 18:32:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:40,228 INFO L225 Difference]: With dead ends: 583 [2023-12-02 18:32:40,228 INFO L226 Difference]: Without dead ends: 407 [2023-12-02 18:32:40,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:32:40,229 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 186 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:40,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 188 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:32:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-02 18:32:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 263. [2023-12-02 18:32:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 246 states have (on average 1.3211382113821137) internal successors, (325), 246 states have internal predecessors, (325), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 349 transitions. [2023-12-02 18:32:40,244 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 349 transitions. Word has length 59 [2023-12-02 18:32:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:40,244 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 349 transitions. [2023-12-02 18:32:40,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 349 transitions. [2023-12-02 18:32:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:40,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:40,245 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:40,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-02 18:32:40,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:40,446 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:40,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash 687867349, now seen corresponding path program 1 times [2023-12-02 18:32:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:40,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712941699] [2023-12-02 18:32:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:40,448 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:40,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 18:32:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:40,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:32:40,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:40,672 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 18:32:40,672 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 33 treesize of output 26 [2023-12-02 18:32:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:32:40,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:40,848 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712941699] [2023-12-02 18:32:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712941699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:40,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:32:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237413541] [2023-12-02 18:32:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:40,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:32:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:32:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:32:40,852 INFO L87 Difference]: Start difference. First operand 263 states and 349 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:41,174 INFO L93 Difference]: Finished difference Result 398 states and 521 transitions. [2023-12-02 18:32:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:32:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-12-02 18:32:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:41,177 INFO L225 Difference]: With dead ends: 398 [2023-12-02 18:32:41,177 INFO L226 Difference]: Without dead ends: 272 [2023-12-02 18:32:41,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:32:41,178 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 69 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:41,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:32:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-02 18:32:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 258. [2023-12-02 18:32:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 241 states have internal predecessors, (315), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2023-12-02 18:32:41,200 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 59 [2023-12-02 18:32:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:41,201 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2023-12-02 18:32:41,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:32:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2023-12-02 18:32:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:41,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:41,202 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:41,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 18:32:41,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:41,402 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:41,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1377437800, now seen corresponding path program 1 times [2023-12-02 18:32:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170532403] [2023-12-02 18:32:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:41,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:41,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:41,404 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:41,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 18:32:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:41,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:32:41,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 18:32:41,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:32:41,620 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170532403] [2023-12-02 18:32:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170532403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:32:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:32:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:32:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561340651] [2023-12-02 18:32:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:32:41,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:32:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:32:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:32:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:32:41,621 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:32:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:32:41,773 INFO L93 Difference]: Finished difference Result 444 states and 583 transitions. [2023-12-02 18:32:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:32:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2023-12-02 18:32:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:32:41,776 INFO L225 Difference]: With dead ends: 444 [2023-12-02 18:32:41,776 INFO L226 Difference]: Without dead ends: 262 [2023-12-02 18:32:41,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:32:41,776 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:32:41,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 353 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:32:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-02 18:32:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2023-12-02 18:32:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 241 states have (on average 1.2987551867219918) internal successors, (313), 241 states have internal predecessors, (313), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-02 18:32:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2023-12-02 18:32:41,796 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 59 [2023-12-02 18:32:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:32:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2023-12-02 18:32:41,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:32:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2023-12-02 18:32:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:32:41,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:32:41,797 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:32:41,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-02 18:32:41,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:41,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:32:41,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:32:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1400070054, now seen corresponding path program 1 times [2023-12-02 18:32:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:32:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760453401] [2023-12-02 18:32:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:32:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:32:42,000 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:32:42,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 18:32:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:42,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 18:32:42,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:43,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:32:44,705 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 [2023-12-02 18:32:44,791 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 [2023-12-02 18:32:44,904 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 [2023-12-02 18:32:45,005 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 130 [2023-12-02 18:32:45,010 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 129 [2023-12-02 18:32:45,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-12-02 18:32:45,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-12-02 18:32:45,162 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 [2023-12-02 18:32:45,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:32:45,669 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 319 treesize of output 129 [2023-12-02 18:32:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:32:45,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:32:45,947 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_487))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_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 [2023-12-02 18:32:46,015 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_486 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_486)))) (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_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_74|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|))) c_~var_1_1_Pointer~0.base v_ArrVal_487))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:32:46,178 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_486 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_483))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_486))))) (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_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_74|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|))) c_~var_1_1_Pointer~0.base v_ArrVal_487))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:32:46,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_486 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (let ((.cse10 (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_482) c_~var_1_8_Pointer~0.base v_ArrVal_483))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_486))))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_74|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|))) c_~var_1_1_Pointer~0.base v_ArrVal_487))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|))))))) is different from false [2023-12-02 18:32:46,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_486 (_ BitVec 32)) (~var_1_10_Pointer~0.offset (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse10 (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_481) c_~var_1_14_Pointer~0.base v_ArrVal_482) c_~var_1_8_Pointer~0.base v_ArrVal_483))) (store .cse10 c_~var_1_9_Pointer~0.base (store (select .cse10 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_486))))) (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_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_74|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|))) c_~var_1_1_Pointer~0.base v_ArrVal_487))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:32:47,920 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:32:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760453401] [2023-12-02 18:32:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760453401] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:32:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2144372184] [2023-12-02 18:32:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:32:47,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:32:47,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:32:47,921 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:32:47,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 18:32:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:32:49,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 18:32:49,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:32:50,388 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 [2023-12-02 18:32:56,743 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 [2023-12-02 18:32:56,967 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 [2023-12-02 18:32:57,190 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 [2023-12-02 18:32:57,374 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 169 treesize of output 126 [2023-12-02 18:32:57,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2023-12-02 18:32:57,639 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 172 treesize of output 130 [2023-12-02 18:32:58,366 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 321 treesize of output 137 [2023-12-02 18:32:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:32:58,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:32:58,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_516))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_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 [2023-12-02 18:32:58,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (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_9_Pointer~0.base v_ArrVal_514))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) c_~var_1_1_Pointer~0.base v_ArrVal_516))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_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_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|)) (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 [2023-12-02 18:32:58,638 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_512) c_~var_1_9_Pointer~0.base v_ArrVal_514))) (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_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|)))) (let ((.cse6 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) c_~var_1_1_Pointer~0.base v_ArrVal_516))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~var_1_10_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 [2023-12-02 18:32:58,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_511) c_~var_1_8_Pointer~0.base v_ArrVal_512) c_~var_1_9_Pointer~0.base v_ArrVal_514))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) c_~var_1_1_Pointer~0.base v_ArrVal_516))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_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_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|))))))) is different from false [2023-12-02 18:32:59,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_79| (_ BitVec 64)) (v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_510) c_~var_1_14_Pointer~0.base v_ArrVal_511) c_~var_1_8_Pointer~0.base v_ArrVal_512) c_~var_1_9_Pointer~0.base v_ArrVal_514))) (or (let ((.cse2 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) c_~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_79|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_79|))) c_~var_1_1_Pointer~0.base v_ArrVal_516))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~var_1_10_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_79|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_79|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_79|)) (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 [2023-12-02 18:33:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2144372184] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:33:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109375401] [2023-12-02 18:33:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:33:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:33:01,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:33:01,664 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:33:01,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 18:33:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:33:02,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 18:33:02,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:33:03,389 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 19 treesize of output 8 [2023-12-02 18:33:11,924 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 60 treesize of output 43 [2023-12-02 18:33:18,174 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 60 treesize of output 43 [2023-12-02 18:33:26,427 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 60 treesize of output 43 [2023-12-02 18:33:36,728 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 120 treesize of output 91 [2023-12-02 18:33:36,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-12-02 18:33:37,175 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 123 treesize of output 95 [2023-12-02 18:33:37,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:33:37,921 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 284 treesize of output 114 [2023-12-02 18:33:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:33:37,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:33:38,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_545))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse2 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 (bvadd c_~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse1 c_~var_1_10_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 [2023-12-02 18:33:38,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_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_9_Pointer~0.base v_ArrVal_542))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~var_1_1_Pointer~0.base v_ArrVal_545))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2023-12-02 18:33:38,292 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse3 (store (store |c_#memory_int| c_~var_1_8_Pointer~0.base v_ArrVal_541) c_~var_1_9_Pointer~0.base v_ArrVal_542))) (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_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|)))) (let ((.cse6 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse7 (store (store .cse3 c_~var_1_10_Pointer~0.base (store (store (select .cse3 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~var_1_1_Pointer~0.base v_ArrVal_545))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 ~var_1_10_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 [2023-12-02 18:33:38,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store |c_#memory_int| c_~var_1_14_Pointer~0.base v_ArrVal_540) c_~var_1_8_Pointer~0.base v_ArrVal_541) c_~var_1_9_Pointer~0.base v_ArrVal_542))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~var_1_1_Pointer~0.base v_ArrVal_545))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2023-12-02 18:33:38,644 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64)) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (~var_1_10_Pointer~0.offset (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) c_~var_1_11_Pointer~0.offset)) (.cse7 (store (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base v_ArrVal_539) c_~var_1_14_Pointer~0.base v_ArrVal_540) c_~var_1_8_Pointer~0.base v_ArrVal_541) c_~var_1_9_Pointer~0.base v_ArrVal_542))) (or (let ((.cse2 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32)))) (let ((.cse3 (store (store .cse7 c_~var_1_10_Pointer~0.base (store (store (select .cse7 c_~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|))) c_~var_1_1_Pointer~0.base v_ArrVal_545))) (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 c_~var_1_10_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 ~var_1_10_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_84|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_84|))))))) is different from false [2023-12-02 18:33:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109375401] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:33:43,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:33:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 45 [2023-12-02 18:33:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330731448] [2023-12-02 18:33:43,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:33:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 18:33:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:33:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 18:33:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2192, Unknown=33, NotChecked=1650, Total=4160 [2023-12-02 18:33:43,668 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 46 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 18:33:46,096 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] [2023-12-02 18:33:48,800 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] [2023-12-02 18:33:51,496 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] [2023-12-02 18:33:54,316 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] [2023-12-02 18:33:56,328 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] [2023-12-02 18:33:58,333 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] [2023-12-02 18:34:00,421 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] [2023-12-02 18:34:02,516 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] [2023-12-02 18:34:04,629 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] [2023-12-02 18:34:06,723 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] [2023-12-02 18:34:08,862 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] [2023-12-02 18:34:10,949 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] [2023-12-02 18:34:13,035 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] [2023-12-02 18:34:15,129 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] [2023-12-02 18:34:17,211 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] [2023-12-02 18:34:18,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:34:20,651 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] [2023-12-02 18:34:32,140 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] [2023-12-02 18:34:34,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:34:36,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:34:39,915 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] [2023-12-02 18:34:45,791 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] [2023-12-02 18:34:47,968 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] [2023-12-02 18:34:50,079 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] [2023-12-02 18:34:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:34:51,001 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2023-12-02 18:34:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 18:34:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 59 [2023-12-02 18:34:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:34:51,005 INFO L225 Difference]: With dead ends: 428 [2023-12-02 18:34:51,005 INFO L226 Difference]: Without dead ends: 309 [2023-12-02 18:34:51,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=762, Invalid=4667, Unknown=33, NotChecked=2370, Total=7832 [2023-12-02 18:34:51,008 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 720 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 131 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:34:51,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1183 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2415 Invalid, 21 Unknown, 0 Unchecked, 60.9s Time] [2023-12-02 18:34:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-02 18:34:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 166. [2023-12-02 18:34:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 151 states have internal predecessors, (190), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 18:34:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2023-12-02 18:34:51,028 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 59 [2023-12-02 18:34:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:34:51,029 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2023-12-02 18:34:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.2790697674418605) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-02 18:34:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2023-12-02 18:34:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 18:34:51,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:34:51,030 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:34:51,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 18:34:51,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 18:34:51,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-02 18:34:51,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:34:51,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:34:51,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:34:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1980236434, now seen corresponding path program 1 times [2023-12-02 18:34:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:34:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879674216] [2023-12-02 18:34:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:34:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:34:51,634 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:34:51,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-02 18:34:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:34:51,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:34:51,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:34:51,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:34:51,896 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 91 treesize of output 31 [2023-12-02 18:34:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:34:51,919 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:34:51,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:34:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879674216] [2023-12-02 18:34:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879674216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:34:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:34:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:34:51,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854352143] [2023-12-02 18:34:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:34:51,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:34:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:34:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:34:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:34:51,920 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:34:52,011 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2023-12-02 18:34:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:34:52,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2023-12-02 18:34:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:34:52,013 INFO L225 Difference]: With dead ends: 292 [2023-12-02 18:34:52,013 INFO L226 Difference]: Without dead ends: 166 [2023-12-02 18:34:52,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:34:52,014 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:34:52,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:34:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-02 18:34:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-02 18:34:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 151 states have internal predecessors, (187), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 18:34:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2023-12-02 18:34:52,033 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 62 [2023-12-02 18:34:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:34:52,034 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2023-12-02 18:34:52,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2023-12-02 18:34:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 18:34:52,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:34:52,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:34:52,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-02 18:34:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:52,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:34:52,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:34:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1761381716, now seen corresponding path program 1 times [2023-12-02 18:34:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:34:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194788471] [2023-12-02 18:34:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:34:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:34:52,237 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:34:52,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 18:34:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:34:52,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 18:34:52,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:34:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:34:53,895 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 13 treesize of output 1 [2023-12-02 18:34:53,938 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 [2023-12-02 18:34:54,020 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 [2023-12-02 18:34:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 18:34:54,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:34:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:34:54,217 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:34:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194788471] [2023-12-02 18:34:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194788471] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 18:34:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:34:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2023-12-02 18:34:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122686525] [2023-12-02 18:34:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:34:54,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:34:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:34:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:34:54,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-12-02 18:34:54,219 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:34:54,970 INFO L93 Difference]: Finished difference Result 332 states and 408 transitions. [2023-12-02 18:34:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 18:34:54,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2023-12-02 18:34:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:34:54,973 INFO L225 Difference]: With dead ends: 332 [2023-12-02 18:34:54,973 INFO L226 Difference]: Without dead ends: 251 [2023-12-02 18:34:54,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2023-12-02 18:34:54,974 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 109 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:34:54,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 295 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:34:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-02 18:34:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2023-12-02 18:34:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 154 states have internal predecessors, (190), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 18:34:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 210 transitions. [2023-12-02 18:34:54,986 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 210 transitions. Word has length 62 [2023-12-02 18:34:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:34:54,986 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 210 transitions. [2023-12-02 18:34:54,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2023-12-02 18:34:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 18:34:54,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:34:54,987 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:34:54,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 18:34:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:55,188 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:34:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:34:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1840366073, now seen corresponding path program 1 times [2023-12-02 18:34:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:34:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424555400] [2023-12-02 18:34:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:34:55,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:34:55,190 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:34:55,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-02 18:34:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:34:55,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:34:55,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:34:55,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:34:55,431 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 91 treesize of output 31 [2023-12-02 18:34:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 18:34:55,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:34:55,460 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:34:55,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424555400] [2023-12-02 18:34:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424555400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:34:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:34:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:34:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278513431] [2023-12-02 18:34:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:34:55,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:34:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:34:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:34:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:34:55,462 INFO L87 Difference]: Start difference. First operand 169 states and 210 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:34:55,863 INFO L93 Difference]: Finished difference Result 303 states and 369 transitions. [2023-12-02 18:34:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:34:55,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2023-12-02 18:34:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:34:55,865 INFO L225 Difference]: With dead ends: 303 [2023-12-02 18:34:55,865 INFO L226 Difference]: Without dead ends: 196 [2023-12-02 18:34:55,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:34:55,866 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 51 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:34:55,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 196 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:34:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-02 18:34:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 152. [2023-12-02 18:34:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 137 states have (on average 1.197080291970803) internal successors, (164), 137 states have internal predecessors, (164), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 18:34:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2023-12-02 18:34:55,878 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 64 [2023-12-02 18:34:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:34:55,878 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2023-12-02 18:34:55,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:34:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2023-12-02 18:34:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 18:34:55,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:34:55,880 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:34:55,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-02 18:34:56,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:56,080 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:34:56,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:34:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -154642598, now seen corresponding path program 1 times [2023-12-02 18:34:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:34:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311814756] [2023-12-02 18:34:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:34:56,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:34:56,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:34:56,082 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 18:34:56,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 18:34:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:34:56,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 18:34:56,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:34:56,889 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 17 treesize of output 9 [2023-12-02 18:34:58,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 18:34:58,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 18:34:58,306 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 [2023-12-02 18:34:58,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 18:34:58,428 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 [2023-12-02 18:34:59,478 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 30 treesize of output 14 [2023-12-02 18:35:00,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-02 18:35:00,516 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 28 treesize of output 23 [2023-12-02 18:35:00,605 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 49 treesize of output 39 [2023-12-02 18:35:00,717 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-12-02 18:35:00,723 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 47 treesize of output 48 [2023-12-02 18:35:00,800 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 47 treesize of output 48 [2023-12-02 18:35:00,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 59 [2023-12-02 18:35:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 18:35:01,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:35:01,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (_ BitVec 32)) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| c_~var_1_9_Pointer~0.base (store (select |c_#memory_int| c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_670)) c_~var_1_10_Pointer~0.base v_ArrVal_668) c_~var_1_1_Pointer~0.base v_ArrVal_671))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset)))))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) c_~var_1_8_Pointer~0.offset)))))) is different from false [2023-12-02 18:35:01,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_8_Pointer~0.offset (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (_ BitVec 32)) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| c_~var_1_8_Pointer~0.base (store (select |c_#memory_int| c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) (select (select |c_#memory_int| c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))))))) (store .cse1 c_~var_1_9_Pointer~0.base (store (select .cse1 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_670))) c_~var_1_10_Pointer~0.base v_ArrVal_668) c_~var_1_1_Pointer~0.base v_ArrVal_671))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))))))) is different from false [2023-12-02 18:35:01,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_8_Pointer~0.offset (_ BitVec 32)) (~var_1_9_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (_ BitVec 32)) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (let ((.cse1 (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))))) (let ((.cse2 (store |c_#memory_int| c_~var_1_14_Pointer~0.base (store (select |c_#memory_int| c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset .cse3)))) (store .cse2 c_~var_1_8_Pointer~0.base (store (select .cse2 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) .cse3))))))))) (store .cse1 c_~var_1_9_Pointer~0.base (store (select .cse1 c_~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset v_ArrVal_670))) c_~var_1_10_Pointer~0.base v_ArrVal_668) c_~var_1_1_Pointer~0.base v_ArrVal_671))) (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset))) (select (select .cse0 c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset)))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset)))))) is different from false [2023-12-02 18:35:03,539 INFO L349 Elim1Store]: treesize reduction 314, result has 37.5 percent of original size [2023-12-02 18:35:03,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 1054 treesize of output 311 [2023-12-02 18:35:04,156 INFO L349 Elim1Store]: treesize reduction 88, result has 35.8 percent of original size [2023-12-02 18:35:04,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 7416 treesize of output 7048 [2023-12-02 18:35:04,790 INFO L349 Elim1Store]: treesize reduction 11, result has 83.6 percent of original size [2023-12-02 18:35:04,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7392 treesize of output 6663 [2023-12-02 18:35:05,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:35:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3358 treesize of output 3190 [2023-12-02 18:35:05,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:35:05,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3166 treesize of output 2806 [2023-12-02 18:35:25,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1454 treesize of output 1420 [2023-12-02 18:35:37,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:35:37,806 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 1474 treesize of output 1446 [2023-12-02 18:35:56,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1454 treesize of output 1420 [2023-12-02 18:36:02,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:36:02,204 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 470 treesize of output 454 [2023-12-02 18:36:03,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 450 treesize of output 428 [2023-12-02 18:36:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 989 treesize of output 955 [2023-12-02 18:36:15,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:36:15,470 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 371 treesize of output 359 [2023-12-02 18:36:18,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:36:18,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 513 treesize of output 497 [2023-12-02 18:36:29,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:36:29,020 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 474 treesize of output 446 [2023-12-02 18:36:48,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:36:48,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4834 treesize of output 4586 [2023-12-02 18:45:24,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 18:45:24,212 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 18:45:24,213 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311814756] [2023-12-02 18:45:24,214 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2023-12-02 18:45:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1415465639] [2023-12-02 18:45:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:45:24,215 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:45:24,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 18:45:24,318 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 42 more [2023-12-02 18:45:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289965432] [2023-12-02 18:45:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:24,322 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:45:24,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 18:45:24,400 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by |v_skolemized_q#valueAsBitvector_99| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:320) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1297) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:387) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-02 18:45:24,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2023-12-02 18:45:24,401 ERROR L171 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2023-12-02 18:45:24,402 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2023-12-02 18:45:24,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 18:45:24,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-12-02 18:45:24,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 18:45:24,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 18:45:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f0f05db-2c20-4a38-b707-d4f88a607ee7/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:25,014 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:25,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:45:25,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:45:25 BoogieIcfgContainer [2023-12-02 18:45:25,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:45:25,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:45:25,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:45:25,050 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:45:25,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:31:09" (3/4) ... [2023-12-02 18:45:25,052 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 18:45:25,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:45:25,053 INFO L158 Benchmark]: Toolchain (without parser) took 856459.89ms. Allocated memory was 75.5MB in the beginning and 283.1MB in the end (delta: 207.6MB). Free memory was 47.1MB in the beginning and 99.9MB in the end (delta: -52.8MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,054 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:25,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.98ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 46.9MB in the beginning and 88.2MB in the end (delta: -41.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.09ms. Allocated memory is still 111.1MB. Free memory was 88.2MB in the beginning and 85.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,055 INFO L158 Benchmark]: Boogie Preprocessor took 50.91ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 82.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,055 INFO L158 Benchmark]: RCFGBuilder took 764.27ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 78.2MB in the end (delta: 4.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,055 INFO L158 Benchmark]: TraceAbstraction took 855266.42ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 77.3MB in the beginning and 99.9MB in the end (delta: -22.6MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. [2023-12-02 18:45:25,055 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 283.1MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:45:25,057 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.20ms. Allocated memory is still 75.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.98ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 46.9MB in the beginning and 88.2MB in the end (delta: -41.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.09ms. Allocated memory is still 111.1MB. Free memory was 88.2MB in the beginning and 85.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.91ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 82.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.27ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 78.2MB in the end (delta: 4.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 855266.42ms. Allocated memory was 111.1MB in the beginning and 283.1MB in the end (delta: 172.0MB). Free memory was 77.3MB in the beginning and 99.9MB in the end (delta: -22.6MB). Peak memory consumption was 177.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 283.1MB. Free memory is still 99.9MB. 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 4; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_7 = 0; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] signed short int var_1_8 = 100; [L29] signed short int* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 32; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] double var_1_10 = 9.2; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 0.975; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] signed short int var_1_12 = 1; [L37] signed short int* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_14 = -16; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char last_1_var_1_1 = 10; [L41] double last_1_var_1_10 = 9.2; [L42] signed short int last_1_var_1_12 = 1; [L43] signed long int last_1_var_1_14 = -16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) [L75] CALL assume_abort_if_not(var_1_3 >= 0) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_3 >= 0) [L76] EXPR \read(var_1_3) [L76] CALL assume_abort_if_not(var_1_3 <= 254) [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_3 <= 254) [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) [L78] CALL assume_abort_if_not(var_1_7 >= 0) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_7 >= 0) [L79] EXPR \read(var_1_7) [L79] CALL assume_abort_if_not(var_1_7 <= 1) [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_7 <= 1) [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] 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 ) [L81] 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 )) [L20] COND FALSE !(!cond) [L81] 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 )) [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; [L48] COND FALSE !(((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0) [L51] (*(var_1_12_Pointer)) = last_1_var_1_12 [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) [L54] COND TRUE (10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_12_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_8_Pointer)) = ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) [L59] COND TRUE (*(var_1_12_Pointer)) <= 16 [L60] EXPR \read(*var_1_3_Pointer) [L60] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR \read(*var_1_9_Pointer) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_11_Pointer) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR (((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND FALSE !(!(cond)) [L100] RET __VERIFIER_assert(property()) [L101] isInitial = 0 [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) [L75] CALL assume_abort_if_not(var_1_3 >= 0) [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not(var_1_3 >= 0) [L76] EXPR \read(var_1_3) [L76] CALL assume_abort_if_not(var_1_3 <= 254) [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_3 <= 254) [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) [L78] CALL assume_abort_if_not(var_1_7 >= 0) [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(var_1_7 >= 0) [L79] EXPR \read(var_1_7) [L79] CALL assume_abort_if_not(var_1_7 <= 1) [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_7 <= 1) [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] 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 ) [L81] 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 )) [L20] COND FALSE !(!cond) [L81] 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 )) [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; [L48] COND FALSE !(((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0) [L51] (*(var_1_12_Pointer)) = last_1_var_1_12 [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) [L54] COND TRUE (10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_12_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_8_Pointer)) = ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) [L59] COND TRUE (*(var_1_12_Pointer)) <= 16 [L60] EXPR \read(*var_1_3_Pointer) [L60] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 855.2s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 97.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 3487 SdHoareTripleChecker+Valid, 86.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3485 mSDsluCounter, 6763 SdHoareTripleChecker+Invalid, 84.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5350 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6733 IncrementalHoareTripleChecker+Invalid, 7080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 1413 mSDtfsCounter, 6733 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1819 GetRequests, 1477 SyntacticMatches, 4 SemanticMatches, 338 ConstructedPredicates, 31 IntricatePredicates, 5 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 94.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=14, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 1281 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 742.5s InterpolantComputationTime, 1565 NumberOfCodeBlocks, 1565 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1654 ConstructedInterpolants, 189 QuantifiedInterpolants, 41845 SizeOfPredicates, 426 NumberOfNonLiveVariables, 5517 ConjunctsInSsa, 600 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 977/1295 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 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN