./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E --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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:46:49,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:46:49,324 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:46:49,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:46:49,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:46:49,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:46:49,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:46:49,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:46:49,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:46:49,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:46:49,354 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:46:49,354 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:46:49,355 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:46:49,356 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:46:49,356 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:46:49,356 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:46:49,356 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:46:49,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:46:49,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:46:49,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:46:49,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:46:49,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:46:49,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:46:49,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:46:49,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:46:49,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:46:49,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:46:49,360 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E 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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2024-11-14 05:46:49,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:46:49,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:46:49,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:46:49,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:46:49,744 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:46:49,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i Unable to find full path for "g++" [2024-11-14 05:46:51,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:46:52,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:46:52,029 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-14 05:46:52,041 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/c4aa933a9/38b13bd3db014fcca32d3739270e53cb/FLAG9a2e6cb2d [2024-11-14 05:46:52,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/c4aa933a9/38b13bd3db014fcca32d3739270e53cb [2024-11-14 05:46:52,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:46:52,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:46:52,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:46:52,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:46:52,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:46:52,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544a2902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52, skipping insertion in model container [2024-11-14 05:46:52,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:46:52,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-14 05:46:52,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:46:52,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:46:52,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-14 05:46:52,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:46:52,491 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:46:52,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52 WrapperNode [2024-11-14 05:46:52,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:46:52,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:46:52,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:46:52,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:46:52,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,572 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 349 [2024-11-14 05:46:52,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:46:52,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:46:52,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:46:52,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:46:52,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:46:52,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:46:52,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:46:52,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:46:52,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (1/1) ... [2024-11-14 05:46:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:46:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:52,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:46:52,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:46:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:46:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:46:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:46:52,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:46:52,836 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:46:52,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:46:53,447 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-14 05:46:53,447 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:46:53,992 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:46:53,993 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:46:53,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:46:53 BoogieIcfgContainer [2024-11-14 05:46:53,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:46:53,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:46:53,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:46:54,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:46:54,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:46:52" (1/3) ... [2024-11-14 05:46:54,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755c938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:46:54, skipping insertion in model container [2024-11-14 05:46:54,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:46:52" (2/3) ... [2024-11-14 05:46:54,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755c938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:46:54, skipping insertion in model container [2024-11-14 05:46:54,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:46:53" (3/3) ... [2024-11-14 05:46:54,006 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2024-11-14 05:46:54,025 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:46:54,027 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-9.i that has 2 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:46:54,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:46:54,097 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63b0cdd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:46:54,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:46:54,101 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) [2024-11-14 05:46:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:46:54,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:54,109 INFO L215 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:46:54,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:46:54,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1067399544, now seen corresponding path program 1 times [2024-11-14 05:46:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580483337] [2024-11-14 05:46:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:46:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788248150] [2024-11-14 05:46:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:55,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:46:55,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:46:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:46:55,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:46:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:46:56,128 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:46:56,131 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:46:56,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 05:46:56,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:46:56,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 05:46:56,339 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 05:46:56,410 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:46:56,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:46:56 BoogieIcfgContainer [2024-11-14 05:46:56,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:46:56,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:46:56,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:46:56,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:46:56,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:46:53" (3/4) ... [2024-11-14 05:46:56,421 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 05:46:56,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:46:56,423 INFO L158 Benchmark]: Toolchain (without parser) took 4350.48ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 59.5MB in the end (delta: 33.3MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-14 05:46:56,426 INFO L158 Benchmark]: CDTParser took 1.80ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:56,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.81ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:46:56,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.31ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:56,427 INFO L158 Benchmark]: Boogie Preprocessor took 54.54ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:56,428 INFO L158 Benchmark]: RCFGBuilder took 1365.74ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 46.2MB in the end (delta: 27.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-14 05:46:56,428 INFO L158 Benchmark]: TraceAbstraction took 2421.14ms. Allocated memory is still 117.4MB. Free memory was 45.7MB in the beginning and 59.5MB in the end (delta: -13.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:56,429 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 59.5MB in the end (delta: 13.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:46:56,430 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.80ms. Allocated memory is still 117.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.81ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.31ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.54ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1365.74ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 46.2MB in the end (delta: 27.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2421.14ms. Allocated memory is still 117.4MB. Free memory was 45.7MB in the beginning and 59.5MB in the end (delta: -13.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 59.5MB in the end (delta: 13.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L37] double last_1_double_Array_0_0_ = 9.2; [L38] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L39] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L40] unsigned char last_1_unsigned_char_Array_0_2_ = 10; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L81] EXPR double_Array_0[0] [L81] last_1_double_Array_0_0_ = double_Array_0[0] [L82] EXPR signed_long_int_Array_0[0] [L82] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L84] EXPR unsigned_char_Array_0[2] [L84] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L44] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; [L45] COND TRUE ((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0 [L46] EXPR unsigned_char_Array_0[1] [L46] EXPR ((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_) [L46] signed_short_int_Array_0[0] = ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))) [L50] EXPR signed_short_int_Array_0[0] [L50] signed_long_int_Array_0[0] = signed_short_int_Array_0[0] [L51] EXPR signed_short_int_Array_0[0] [L51] EXPR 10 << signed_short_int_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] [L51] COND TRUE (10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0]) [L52] EXPR signed_short_int_Array_0[0] [L52] EXPR signed_long_int_Array_0[0] [L52] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]) [L54] unsigned_char_Array_0[0] = 64 [L55] EXPR double_Array_0[1] [L55] double_Array_0[0] = double_Array_0[1] [L56] EXPR signed_short_int_Array_0[0] [L56] COND TRUE signed_short_int_Array_0[0] <= 16 [L57] EXPR unsigned_char_Array_0[1] [L57] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR unsigned_char_Array_0[2] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR 10 << signed_short_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR unsigned_char_Array_0[0] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR double_Array_0[0] [L87] EXPR double_Array_0[1] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) [L87] EXPR (((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR (((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) [L87-L88] return ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, 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, 1.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 05:46:56,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E --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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:46:59,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:46:59,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 05:46:59,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:46:59,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:46:59,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:46:59,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:46:59,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:46:59,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:46:59,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:46:59,362 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:46:59,362 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:46:59,362 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:46:59,363 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:46:59,363 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:46:59,363 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:46:59,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:46:59,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:46:59,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:46:59,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:46:59,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:46:59,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:46:59,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:46:59,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:46:59,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:46:59,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:46:59,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:46:59,369 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:46:59,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:46:59,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:46:59,369 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:46:59,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E 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 -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2024-11-14 05:46:59,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:46:59,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:46:59,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:46:59,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:46:59,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:46:59,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i Unable to find full path for "g++" [2024-11-14 05:47:01,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:47:02,082 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:47:02,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-14 05:47:02,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/6026c5844/c186517ecd7c43a2b827f878dee140cc/FLAGc5ade8f05 [2024-11-14 05:47:02,122 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/data/6026c5844/c186517ecd7c43a2b827f878dee140cc [2024-11-14 05:47:02,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:47:02,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:47:02,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:47:02,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:47:02,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:47:02,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4224e5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02, skipping insertion in model container [2024-11-14 05:47:02,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:47:02,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-14 05:47:02,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:47:02,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:47:02,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-14 05:47:02,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:47:02,617 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:47:02,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02 WrapperNode [2024-11-14 05:47:02,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:47:02,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:47:02,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:47:02,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:47:02,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,682 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 335 [2024-11-14 05:47:02,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:47:02,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:47:02,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:47:02,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:47:02,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:47:02,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:47:02,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:47:02,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:47:02,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (1/1) ... [2024-11-14 05:47:02,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:47:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:02,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:47:02,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 05:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 05:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 05:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:47:02,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:47:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 05:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 05:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:47:02,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:47:03,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:47:03,845 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-14 05:47:03,845 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:47:03,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:47:03,861 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:47:03,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:03 BoogieIcfgContainer [2024-11-14 05:47:03,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:47:03,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:47:03,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:47:03,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:47:03,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:47:02" (1/3) ... [2024-11-14 05:47:03,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75560e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:03, skipping insertion in model container [2024-11-14 05:47:03,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:02" (2/3) ... [2024-11-14 05:47:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75560e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:03, skipping insertion in model container [2024-11-14 05:47:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:03" (3/3) ... [2024-11-14 05:47:03,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2024-11-14 05:47:03,892 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:47:03,894 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-9.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:47:03,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:47:03,966 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b50f645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:47:03,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:47:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 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) [2024-11-14 05:47:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:47:03,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:03,981 INFO L215 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] [2024-11-14 05:47:03,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:03,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1199478243, now seen corresponding path program 1 times [2024-11-14 05:47:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335902282] [2024-11-14 05:47:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:04,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:04,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:47:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:04,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:47:04,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-14 05:47:04,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:04,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335902282] [2024-11-14 05:47:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335902282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:04,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:47:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147218754] [2024-11-14 05:47:04,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:04,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:47:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:47:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:47:04,488 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-14 05:47:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:04,516 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-14 05:47:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:47:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-14 05:47:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:04,525 INFO L225 Difference]: With dead ends: 133 [2024-11-14 05:47:04,525 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 05:47:04,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:47:04,531 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:47:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 05:47:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-14 05:47:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 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) [2024-11-14 05:47:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-14 05:47:04,583 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-14 05:47:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:04,584 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-14 05:47:04,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-14 05:47:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-14 05:47:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:47:04,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:04,588 INFO L215 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] [2024-11-14 05:47:04,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:47:04,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:04,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:04,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 597730465, now seen corresponding path program 1 times [2024-11-14 05:47:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050973152] [2024-11-14 05:47:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:04,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:04,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:04,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:04,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:47:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:05,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:47:05,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:47:05,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:05,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050973152] [2024-11-14 05:47:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050973152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:05,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:47:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813659163] [2024-11-14 05:47:05,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:05,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:47:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:05,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:47:05,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:05,181 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2024-11-14 05:47:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:05,250 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2024-11-14 05:47:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:47:05,251 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), 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 60 [2024-11-14 05:47:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:05,252 INFO L225 Difference]: With dead ends: 132 [2024-11-14 05:47:05,252 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:47:05,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:47:05,253 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:05,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:47:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:47:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-14 05:47:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 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) [2024-11-14 05:47:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-14 05:47:05,270 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-14 05:47:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-14 05:47:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2024-11-14 05:47:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-14 05:47:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:47:05,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:05,276 INFO L215 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] [2024-11-14 05:47:05,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 05:47:05,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:05,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:05,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1298795043, now seen corresponding path program 1 times [2024-11-14 05:47:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:05,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138689968] [2024-11-14 05:47:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:05,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:05,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:47:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:05,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:47:05,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:47:05,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:05,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138689968] [2024-11-14 05:47:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138689968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:05,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:05,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:47:05,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779246218] [2024-11-14 05:47:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:05,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:47:05,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:47:05,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:47:05,827 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-14 05:47:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:05,919 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-14 05:47:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:47:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 60 [2024-11-14 05:47:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:05,922 INFO L225 Difference]: With dead ends: 136 [2024-11-14 05:47:05,922 INFO L226 Difference]: Without dead ends: 71 [2024-11-14 05:47:05,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:47:05,923 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:05,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:47:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-14 05:47:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-14 05:47:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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) [2024-11-14 05:47:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-14 05:47:05,943 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-14 05:47:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:05,944 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-14 05:47:05,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-14 05:47:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-14 05:47:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:47:05,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:05,948 INFO L215 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] [2024-11-14 05:47:05,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 05:47:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:06,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1978853413, now seen corresponding path program 1 times [2024-11-14 05:47:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224508131] [2024-11-14 05:47:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:06,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:06,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:06,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 05:47:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:06,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:47:06,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:47:06,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:06,477 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224508131] [2024-11-14 05:47:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224508131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:47:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610767604] [2024-11-14 05:47:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:47:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:47:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:06,479 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2024-11-14 05:47:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:06,581 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-11-14 05:47:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:47:06,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 60 [2024-11-14 05:47:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:06,583 INFO L225 Difference]: With dead ends: 142 [2024-11-14 05:47:06,583 INFO L226 Difference]: Without dead ends: 75 [2024-11-14 05:47:06,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:06,584 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:06,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:47:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-14 05:47:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-14 05:47:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 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) [2024-11-14 05:47:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-14 05:47:06,604 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2024-11-14 05:47:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:06,604 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-14 05:47:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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) [2024-11-14 05:47:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-14 05:47:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 05:47:06,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:06,607 INFO L215 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] [2024-11-14 05:47:06,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 05:47:06,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:06,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1980700455, now seen corresponding path program 1 times [2024-11-14 05:47:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965420096] [2024-11-14 05:47:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:06,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:06,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 05:47:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:07,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:47:07,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:07,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-14 05:47:07,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:07,204 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 66 treesize of output 30 [2024-11-14 05:47:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:47:07,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:47:07,236 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965420096] [2024-11-14 05:47:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965420096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:47:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:47:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:47:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558655889] [2024-11-14 05:47:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:47:07,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:47:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:47:07,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:47:07,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:47:07,238 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-14 05:47:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:47:07,755 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-11-14 05:47:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:47:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 60 [2024-11-14 05:47:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:47:07,758 INFO L225 Difference]: With dead ends: 149 [2024-11-14 05:47:07,758 INFO L226 Difference]: Without dead ends: 78 [2024-11-14 05:47:07,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:47:07,759 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:47:07,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:47:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-14 05:47:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-14 05:47:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 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) [2024-11-14 05:47:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-14 05:47:07,767 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-14 05:47:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:47:07,767 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-14 05:47:07,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-14 05:47:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-14 05:47:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:47:07,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:47:07,769 INFO L215 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] [2024-11-14 05:47:07,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-14 05:47:07,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:07,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:47:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:47:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash 510062046, now seen corresponding path program 1 times [2024-11-14 05:47:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:47:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70405030] [2024-11-14 05:47:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:47:07,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:47:07,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:47:07,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 05:47:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:08,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:47:08,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:08,900 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 20 treesize of output 21 [2024-11-14 05:47:10,322 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 141 treesize of output 110 [2024-11-14 05:47:11,338 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 141 treesize of output 110 [2024-11-14 05:47:11,441 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 141 treesize of output 110 [2024-11-14 05:47:11,611 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 141 treesize of output 110 [2024-11-14 05:47:11,795 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 213 treesize of output 165 [2024-11-14 05:47:11,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:11,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 106 [2024-11-14 05:47:12,103 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 171 treesize of output 142 [2024-11-14 05:47:13,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:47:13,089 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 356 treesize of output 148 [2024-11-14 05:47:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:47:13,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:15,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_127) |c_~#double_Array_0~0.base|))) (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 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))))))) is different from false [2024-11-14 05:47:15,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_126))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_127) |c_~#double_Array_0~0.base|))) (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 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:47:15,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_125) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_126))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_127) |c_~#double_Array_0~0.base|))) (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 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:47:16,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:47:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70405030] [2024-11-14 05:47:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70405030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [886519108] [2024-11-14 05:47:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:16,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:47:16,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:47:16,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:47:16,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 05:47:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:17,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:47:17,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:17,831 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 [2024-11-14 05:47:31,279 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 [2024-11-14 05:47:31,988 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 [2024-11-14 05:47:32,056 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 [2024-11-14 05:47:36,247 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 [2024-11-14 05:47:38,426 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 163 treesize of output 117 [2024-11-14 05:47:38,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 117 treesize of output 96 [2024-11-14 05:47:38,738 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 166 treesize of output 121 [2024-11-14 05:47:39,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 135 [2024-11-14 05:47:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:47:39,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:39,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_158) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) (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 [2024-11-14 05:47:40,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_157))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_158) |c_~#double_Array_0~0.base|))) (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 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:47:40,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_32| (_ BitVec 64))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_156) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_157))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_158) |c_~#double_Array_0~0.base|))) (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 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_32|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_32|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:47:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [886519108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684951701] [2024-11-14 05:47:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:40,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:40,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:47:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:40,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-14 05:47:40,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:41,003 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 25 treesize of output 10 [2024-11-14 05:48:02,552 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 131 treesize of output 102 [2024-11-14 05:48:03,235 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 131 treesize of output 102 [2024-11-14 05:48:03,301 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 131 treesize of output 102 [2024-11-14 05:48:11,583 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 131 treesize of output 102 [2024-11-14 05:48:19,841 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 203 treesize of output 157 [2024-11-14 05:48:19,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:19,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 102 [2024-11-14 05:48:20,066 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 171 treesize of output 142 [2024-11-14 05:48:20,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:20,668 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 356 treesize of output 148 [2024-11-14 05:48:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:48:20,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:20,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_189) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (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 ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 05:48:21,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_187 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_187))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_189) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (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 ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 05:48:21,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_187 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_186) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_187))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_189) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_130) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (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 ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 05:48:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684951701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:21,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-11-14 05:48:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137715263] [2024-11-14 05:48:21,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:21,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:48:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:48:21,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=737, Unknown=56, NotChecked=576, Total=1482 [2024-11-14 05:48:21,201 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-14 05:48:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:30,901 INFO L93 Difference]: Finished difference Result 215 states and 289 transitions. [2024-11-14 05:48:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:48:30,903 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 62 [2024-11-14 05:48:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:30,904 INFO L225 Difference]: With dead ends: 215 [2024-11-14 05:48:30,904 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 05:48:30,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=229, Invalid=1156, Unknown=57, NotChecked=720, Total=2162 [2024-11-14 05:48:30,907 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 591 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 58 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:30,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 560 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 879 Invalid, 9 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 05:48:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 05:48:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 120. [2024-11-14 05:48:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 05:48:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2024-11-14 05:48:30,932 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 62 [2024-11-14 05:48:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:30,932 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2024-11-14 05:48:30,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 27 states have internal predecessors, (93), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-14 05:48:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2024-11-14 05:48:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:48:30,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:30,944 INFO L215 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] [2024-11-14 05:48:30,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 05:48:31,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:48:31,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-14 05:48:31,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:48:31,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1190120416, now seen corresponding path program 1 times [2024-11-14 05:48:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112671436] [2024-11-14 05:48:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:31,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:31,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:31,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 05:48:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:31,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:48:31,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:32,037 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 [2024-11-14 05:48:32,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 05:48:32,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:32,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-14 05:48:32,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:32,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2024-11-14 05:48:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:32,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:32,281 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112671436] [2024-11-14 05:48:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112671436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:48:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914255856] [2024-11-14 05:48:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:48:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:48:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:48:32,283 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) 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) [2024-11-14 05:48:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:33,091 INFO L93 Difference]: Finished difference Result 239 states and 327 transitions. [2024-11-14 05:48:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:48:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) 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 [2024-11-14 05:48:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:33,093 INFO L225 Difference]: With dead ends: 239 [2024-11-14 05:48:33,093 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 05:48:33,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:48:33,095 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 142 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:33,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 165 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:48:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 05:48:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-14 05:48:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 109 states have internal predecessors, (146), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 05:48:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2024-11-14 05:48:33,109 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 62 [2024-11-14 05:48:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2024-11-14 05:48:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) 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) [2024-11-14 05:48:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2024-11-14 05:48:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:48:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:33,112 INFO L215 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] [2024-11-14 05:48:33,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 05:48:33,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:33,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:33,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1891184994, now seen corresponding path program 1 times [2024-11-14 05:48:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146606773] [2024-11-14 05:48:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:33,315 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:33,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 05:48:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:33,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:48:33,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:33,671 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 [2024-11-14 05:48:34,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:48:34,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:48:34,304 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 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-14 05:48:34,396 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 52 treesize of output 41 [2024-11-14 05:48:34,458 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 47 treesize of output 41 [2024-11-14 05:48:34,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:34,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 53 [2024-11-14 05:48:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:34,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:34,685 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:34,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146606773] [2024-11-14 05:48:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146606773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:34,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 05:48:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988232199] [2024-11-14 05:48:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:34,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:48:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:48:34,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:48:34,688 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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) [2024-11-14 05:48:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:37,385 INFO L93 Difference]: Finished difference Result 525 states and 711 transitions. [2024-11-14 05:48:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 05:48:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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 [2024-11-14 05:48:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:37,389 INFO L225 Difference]: With dead ends: 525 [2024-11-14 05:48:37,389 INFO L226 Difference]: Without dead ends: 408 [2024-11-14 05:48:37,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2024-11-14 05:48:37,390 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 440 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:37,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 330 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:48:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-14 05:48:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 281. [2024-11-14 05:48:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.353846153846154) internal successors, (352), 260 states have internal predecessors, (352), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 384 transitions. [2024-11-14 05:48:37,421 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 384 transitions. Word has length 62 [2024-11-14 05:48:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:37,422 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 384 transitions. [2024-11-14 05:48:37,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 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) [2024-11-14 05:48:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 384 transitions. [2024-11-14 05:48:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:48:37,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:37,423 INFO L215 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] [2024-11-14 05:48:37,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-14 05:48:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:37,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1981080476, now seen corresponding path program 1 times [2024-11-14 05:48:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919393951] [2024-11-14 05:48:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:37,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:37,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:37,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:37,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-14 05:48:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:37,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:48:37,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:38,015 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 [2024-11-14 05:48:38,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:48:38,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:48:38,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:48:38,887 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 62 treesize of output 62 [2024-11-14 05:48:38,896 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 61 treesize of output 56 [2024-11-14 05:48:39,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 68 [2024-11-14 05:48:39,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:39,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2024-11-14 05:48:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:39,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:39,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919393951] [2024-11-14 05:48:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919393951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:39,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:48:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217403810] [2024-11-14 05:48:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:39,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:48:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:48:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:48:39,392 INFO L87 Difference]: Start difference. First operand 281 states and 384 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 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) [2024-11-14 05:48:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:42,090 INFO L93 Difference]: Finished difference Result 678 states and 915 transitions. [2024-11-14 05:48:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:48:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 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 [2024-11-14 05:48:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:42,093 INFO L225 Difference]: With dead ends: 678 [2024-11-14 05:48:42,093 INFO L226 Difference]: Without dead ends: 400 [2024-11-14 05:48:42,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:48:42,096 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 261 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:42,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 366 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:48:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-14 05:48:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 275. [2024-11-14 05:48:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 254 states have (on average 1.3464566929133859) internal successors, (342), 254 states have internal predecessors, (342), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 374 transitions. [2024-11-14 05:48:42,132 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 374 transitions. Word has length 62 [2024-11-14 05:48:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:42,132 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 374 transitions. [2024-11-14 05:48:42,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 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) [2024-11-14 05:48:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 374 transitions. [2024-11-14 05:48:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 05:48:42,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:42,134 INFO L215 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] [2024-11-14 05:48:42,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-14 05:48:42,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:42,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:42,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1403548384, now seen corresponding path program 1 times [2024-11-14 05:48:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:42,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134217993] [2024-11-14 05:48:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:42,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:42,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:42,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:42,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 05:48:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:42,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:48:42,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:48:42,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:42,555 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134217993] [2024-11-14 05:48:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134217993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:48:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403045092] [2024-11-14 05:48:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:42,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:48:42,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:48:42,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:48:42,556 INFO L87 Difference]: Start difference. First operand 275 states and 374 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-11-14 05:48:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:42,628 INFO L93 Difference]: Finished difference Result 547 states and 745 transitions. [2024-11-14 05:48:42,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:48:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 62 [2024-11-14 05:48:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:42,630 INFO L225 Difference]: With dead ends: 547 [2024-11-14 05:48:42,630 INFO L226 Difference]: Without dead ends: 275 [2024-11-14 05:48:42,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:48:42,631 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:42,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:48:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-14 05:48:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-14 05:48:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 254 states have (on average 1.3385826771653544) internal successors, (340), 254 states have internal predecessors, (340), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 372 transitions. [2024-11-14 05:48:42,652 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 372 transitions. Word has length 62 [2024-11-14 05:48:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 372 transitions. [2024-11-14 05:48:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-11-14 05:48:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 372 transitions. [2024-11-14 05:48:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:42,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:42,654 INFO L215 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] [2024-11-14 05:48:42,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 05:48:42,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:42,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:42,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2072764050, now seen corresponding path program 1 times [2024-11-14 05:48:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:42,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879941314] [2024-11-14 05:48:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:42,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:42,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:42,858 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:42,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 05:48:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:43,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:48:43,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:43,215 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 [2024-11-14 05:48:43,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:48:43,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:48:43,825 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 0 case distinctions, treesize of input 46 treesize of output 40 [2024-11-14 05:48:43,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:43,909 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 1 case distinctions, treesize of input 52 treesize of output 60 [2024-11-14 05:48:43,915 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 51 treesize of output 50 [2024-11-14 05:48:44,001 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 51 treesize of output 45 [2024-11-14 05:48:44,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:44,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 38 [2024-11-14 05:48:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:44,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:44,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879941314] [2024-11-14 05:48:44,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879941314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:44,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:44,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 05:48:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390490586] [2024-11-14 05:48:44,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:44,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 05:48:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 05:48:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:48:44,701 INFO L87 Difference]: Start difference. First operand 275 states and 372 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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) [2024-11-14 05:48:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:47,696 INFO L93 Difference]: Finished difference Result 410 states and 541 transitions. [2024-11-14 05:48:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:48:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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 [2024-11-14 05:48:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:47,700 INFO L225 Difference]: With dead ends: 410 [2024-11-14 05:48:47,700 INFO L226 Difference]: Without dead ends: 408 [2024-11-14 05:48:47,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:48:47,701 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 370 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 21 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:47,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 412 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 625 Invalid, 8 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 05:48:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-14 05:48:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 278. [2024-11-14 05:48:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 257 states have internal predecessors, (343), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 375 transitions. [2024-11-14 05:48:47,726 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 375 transitions. Word has length 64 [2024-11-14 05:48:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:47,727 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 375 transitions. [2024-11-14 05:48:47,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 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) [2024-11-14 05:48:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 375 transitions. [2024-11-14 05:48:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:47,731 INFO L215 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] [2024-11-14 05:48:47,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:48:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:47,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2070917008, now seen corresponding path program 1 times [2024-11-14 05:48:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558991474] [2024-11-14 05:48:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:47,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:47,935 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:47,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 05:48:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:48,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:48:48,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:48,256 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 [2024-11-14 05:48:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 05:48:48,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:48:48,957 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 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-14 05:48:49,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:49,073 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 1 case distinctions, treesize of input 58 treesize of output 58 [2024-11-14 05:48:49,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2024-11-14 05:48:49,176 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 57 treesize of output 47 [2024-11-14 05:48:49,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:49,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 47 [2024-11-14 05:48:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:49,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:49,965 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558991474] [2024-11-14 05:48:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558991474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:49,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-14 05:48:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531942817] [2024-11-14 05:48:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:49,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:48:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:48:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:48:49,967 INFO L87 Difference]: Start difference. First operand 278 states and 375 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 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) [2024-11-14 05:48:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:52,864 INFO L93 Difference]: Finished difference Result 689 states and 918 transitions. [2024-11-14 05:48:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:48:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 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 [2024-11-14 05:48:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:52,868 INFO L225 Difference]: With dead ends: 689 [2024-11-14 05:48:52,868 INFO L226 Difference]: Without dead ends: 414 [2024-11-14 05:48:52,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-14 05:48:52,870 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 375 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 40 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:52,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 412 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 626 Invalid, 7 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:48:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-14 05:48:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 281. [2024-11-14 05:48:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.3307692307692307) internal successors, (346), 260 states have internal predecessors, (346), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 378 transitions. [2024-11-14 05:48:52,899 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 378 transitions. Word has length 64 [2024-11-14 05:48:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:52,900 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 378 transitions. [2024-11-14 05:48:52,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 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) [2024-11-14 05:48:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 378 transitions. [2024-11-14 05:48:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:52,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:52,901 INFO L215 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] [2024-11-14 05:48:52,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-14 05:48:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:53,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1629991343, now seen corresponding path program 1 times [2024-11-14 05:48:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012164298] [2024-11-14 05:48:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:53,105 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:53,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 05:48:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:53,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:48:53,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:53,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:53,323 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 [2024-11-14 05:48:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:53,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:53,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:53,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012164298] [2024-11-14 05:48:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012164298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:53,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:53,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:48:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396930355] [2024-11-14 05:48:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:53,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:48:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:53,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:48:53,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:48:53,351 INFO L87 Difference]: Start difference. First operand 281 states and 378 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2024-11-14 05:48:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:53,404 INFO L93 Difference]: Finished difference Result 559 states and 753 transitions. [2024-11-14 05:48:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:48:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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 [2024-11-14 05:48:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:53,407 INFO L225 Difference]: With dead ends: 559 [2024-11-14 05:48:53,407 INFO L226 Difference]: Without dead ends: 281 [2024-11-14 05:48:53,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:48:53,408 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:53,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:48:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-14 05:48:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-14 05:48:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.3076923076923077) internal successors, (340), 260 states have internal predecessors, (340), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2024-11-14 05:48:53,432 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 64 [2024-11-14 05:48:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:53,433 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2024-11-14 05:48:53,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2024-11-14 05:48:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2024-11-14 05:48:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:53,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:53,434 INFO L215 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] [2024-11-14 05:48:53,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-14 05:48:53,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:53,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:53,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash -364153363, now seen corresponding path program 1 times [2024-11-14 05:48:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752712056] [2024-11-14 05:48:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:53,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:53,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:53,637 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:53,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 05:48:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:53,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:48:53,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:54,145 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 [2024-11-14 05:48:54,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 18 treesize of output 13 [2024-11-14 05:48:54,198 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 [2024-11-14 05:48:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:54,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:54,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752712056] [2024-11-14 05:48:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752712056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:48:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717613001] [2024-11-14 05:48:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:48:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:48:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:48:54,227 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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) [2024-11-14 05:48:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:54,851 INFO L93 Difference]: Finished difference Result 663 states and 866 transitions. [2024-11-14 05:48:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:48:54,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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 [2024-11-14 05:48:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:54,855 INFO L225 Difference]: With dead ends: 663 [2024-11-14 05:48:54,855 INFO L226 Difference]: Without dead ends: 385 [2024-11-14 05:48:54,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:48:54,858 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 125 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:54,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 194 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:48:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-14 05:48:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 293. [2024-11-14 05:48:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2941176470588236) internal successors, (352), 272 states have internal predecessors, (352), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:48:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 384 transitions. [2024-11-14 05:48:54,890 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 384 transitions. Word has length 64 [2024-11-14 05:48:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:54,891 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 384 transitions. [2024-11-14 05:48:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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) [2024-11-14 05:48:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 384 transitions. [2024-11-14 05:48:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:54,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:54,892 INFO L215 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] [2024-11-14 05:48:54,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 05:48:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:55,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 967155165, now seen corresponding path program 1 times [2024-11-14 05:48:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734462498] [2024-11-14 05:48:55,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:55,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:55,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 05:48:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:55,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:48:55,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:55,344 INFO L349 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2024-11-14 05:48:55,344 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 37 treesize of output 28 [2024-11-14 05:48:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:48:55,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:48:55,600 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:48:55,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734462498] [2024-11-14 05:48:55,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734462498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:48:55,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:48:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:48:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365743360] [2024-11-14 05:48:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:48:55,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:48:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:48:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:48:55,602 INFO L87 Difference]: Start difference. First operand 293 states and 384 transitions. Second operand has 5 states, 5 states have (on average 8.4) 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) [2024-11-14 05:48:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:48:56,122 INFO L93 Difference]: Finished difference Result 744 states and 975 transitions. [2024-11-14 05:48:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:48:56,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) 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 [2024-11-14 05:48:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:48:56,126 INFO L225 Difference]: With dead ends: 744 [2024-11-14 05:48:56,127 INFO L226 Difference]: Without dead ends: 454 [2024-11-14 05:48:56,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:48:56,130 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 59 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:48:56,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 278 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:48:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-14 05:48:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 433. [2024-11-14 05:48:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 402 states have (on average 1.2985074626865671) internal successors, (522), 402 states have internal predecessors, (522), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:48:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 570 transitions. [2024-11-14 05:48:56,164 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 570 transitions. Word has length 64 [2024-11-14 05:48:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:48:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 570 transitions. [2024-11-14 05:48:56,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) 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) [2024-11-14 05:48:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 570 transitions. [2024-11-14 05:48:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:48:56,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:48:56,167 INFO L215 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] [2024-11-14 05:48:56,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 05:48:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:56,368 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:48:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:48:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1728626492, now seen corresponding path program 1 times [2024-11-14 05:48:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:48:56,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802640891] [2024-11-14 05:48:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:48:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:48:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:48:56,371 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:48:56,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-14 05:48:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:48:56,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 05:48:56,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:48:57,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:48:57,895 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 119 treesize of output 92 [2024-11-14 05:48:58,388 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 119 treesize of output 92 [2024-11-14 05:48:58,419 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 119 treesize of output 92 [2024-11-14 05:48:58,510 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 119 treesize of output 92 [2024-11-14 05:48:58,597 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 162 [2024-11-14 05:48:58,602 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 0 case distinctions, treesize of input 195 treesize of output 159 [2024-11-14 05:48:58,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:58,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 96 [2024-11-14 05:48:58,653 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 9 treesize of output 8 [2024-11-14 05:48:58,807 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 0 case distinctions, treesize of input 202 treesize of output 157 [2024-11-14 05:48:59,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:48:59,288 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 379 treesize of output 129 [2024-11-14 05:48:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:48:59,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:02,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_68| (_ BitVec 64)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_428))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| (store (select .cse6 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_68|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_68|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_432) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_68|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_68|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_68|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 05:49:02,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_68| (_ BitVec 64)) (|~#unsigned_char_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_427) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_428))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| (store (select .cse8 |c_~#unsigned_char_Array_0~0.base|) |~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base|))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_68|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_68|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_68|)) (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_68|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_68|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_432) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:49:02,620 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:49:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802640891] [2024-11-14 05:49:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802640891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [522045034] [2024-11-14 05:49:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:49:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:49:02,623 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:49:02,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-14 05:49:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:03,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:49:03,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 05:49:10,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-14 05:49:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-14 05:49:11,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-14 05:49:12,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 80 [2024-11-14 05:49:12,288 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 169 treesize of output 121 [2024-11-14 05:49:12,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 98 [2024-11-14 05:49:12,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-11-14 05:49:13,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 78 [2024-11-14 05:49:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:49:13,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [522045034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:17,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280134917] [2024-11-14 05:49:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:17,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:49:17,531 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:49:17,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:49:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:18,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 05:49:18,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:19,331 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 20 treesize of output 21 [2024-11-14 05:49:52,246 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 139 treesize of output 108 [2024-11-14 05:49:53,267 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 139 treesize of output 108 [2024-11-14 05:49:53,373 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 139 treesize of output 108 [2024-11-14 05:49:57,676 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 139 treesize of output 108 [2024-11-14 05:50:04,050 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 211 treesize of output 163 [2024-11-14 05:50:04,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:04,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 104 [2024-11-14 05:50:04,950 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 169 treesize of output 140 [2024-11-14 05:50:05,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:05,794 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 379 treesize of output 129 [2024-11-14 05:50:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:50:05,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:50:05,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (select .cse1 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) is different from false [2024-11-14 05:50:06,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse6 (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_487) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| (store (store .cse6 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)) (let ((.cse7 (concat (select .cse6 .cse4) (select .cse6 .cse5)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))) is different from false [2024-11-14 05:50:06,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_486))) (let ((.cse2 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse3 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)) (.cse1 (select (store .cse8 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_487) |c_~#double_Array_0~0.base|))) (or (not (= (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 .cse3)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)))) (let ((.cse6 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#double_Array_0~0.base| (store (store .cse1 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse4 (concat (select .cse5 .cse6) (select .cse5 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse7 (concat (select .cse5 .cse2) (select .cse5 .cse3)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))))))) is different from false [2024-11-14 05:50:06,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_487 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (v_ArrVal_485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_485) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_486))) (let ((.cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) (.cse7 (select (store .cse6 |c_~#unsigned_char_Array_0~0.base| v_ArrVal_487) |c_~#double_Array_0~0.base|)) (.cse5 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|))) (let ((.cse1 (select (store (store .cse6 |c_~#double_Array_0~0.base| (store (store .cse7 |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_490) |c_~#double_Array_0~0.base|))) (fp.eq (let ((.cse0 (concat (select .cse1 .cse2) (select .cse1 |c_~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse3 (concat (select .cse1 .cse4) (select .cse1 .cse5)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)) (let ((.cse8 (concat (select .cse7 .cse4) (select .cse7 .cse5)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2024-11-14 05:50:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280134917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:50:06,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:50:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 39 [2024-11-14 05:50:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000270649] [2024-11-14 05:50:06,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:50:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-14 05:50:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:50:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-14 05:50:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1704, Unknown=86, NotChecked=558, Total=2652 [2024-11-14 05:50:06,309 INFO L87 Difference]: Start difference. First operand 433 states and 570 transitions. Second operand has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-14 05:50:08,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:10,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:12,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:14,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:16,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:19,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:21,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:23,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:25,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:27,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:29,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:31,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:33,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:35,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:37,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:39,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:41,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:43,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:45,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:52,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:56,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:50:58,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:51:00,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:51:04,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:51:06,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:51:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:06,905 INFO L93 Difference]: Finished difference Result 978 states and 1266 transitions. [2024-11-14 05:51:06,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 05:51:06,907 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) Word has length 64 [2024-11-14 05:51:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:06,911 INFO L225 Difference]: With dead ends: 978 [2024-11-14 05:51:06,911 INFO L226 Difference]: Without dead ends: 688 [2024-11-14 05:51:06,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=652, Invalid=2826, Unknown=86, NotChecked=726, Total=4290 [2024-11-14 05:51:06,914 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 753 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 116 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:06,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 733 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1118 Invalid, 34 Unknown, 0 Unchecked, 57.9s Time] [2024-11-14 05:51:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-14 05:51:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 487. [2024-11-14 05:51:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 438 states have (on average 1.273972602739726) internal successors, (558), 441 states have internal predecessors, (558), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-14 05:51:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 624 transitions. [2024-11-14 05:51:06,989 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 624 transitions. Word has length 64 [2024-11-14 05:51:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:06,990 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 624 transitions. [2024-11-14 05:51:06,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 8 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-14 05:51:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 624 transitions. [2024-11-14 05:51:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 05:51:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:06,992 INFO L215 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] [2024-11-14 05:51:07,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:07,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-14 05:51:07,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-14 05:51:07,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:51:07,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 516952962, now seen corresponding path program 1 times [2024-11-14 05:51:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850040446] [2024-11-14 05:51:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:07,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:07,597 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:07,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-14 05:51:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:07,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:51:07,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:51:07,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:51:07,985 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850040446] [2024-11-14 05:51:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850040446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:07,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:07,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:51:07,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14175589] [2024-11-14 05:51:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:07,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:51:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:07,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:51:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:07,987 INFO L87 Difference]: Start difference. First operand 487 states and 624 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:51:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:08,223 INFO L93 Difference]: Finished difference Result 736 states and 925 transitions. [2024-11-14 05:51:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:51:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 64 [2024-11-14 05:51:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:08,233 INFO L225 Difference]: With dead ends: 736 [2024-11-14 05:51:08,234 INFO L226 Difference]: Without dead ends: 329 [2024-11-14 05:51:08,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:51:08,235 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:08,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:51:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-14 05:51:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2024-11-14 05:51:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 274 states have (on average 1.2335766423357664) internal successors, (338), 277 states have internal predecessors, (338), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:51:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 386 transitions. [2024-11-14 05:51:08,287 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 386 transitions. Word has length 64 [2024-11-14 05:51:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 386 transitions. [2024-11-14 05:51:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-14 05:51:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 386 transitions. [2024-11-14 05:51:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 05:51:08,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:08,289 INFO L215 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, 1, 1, 1] [2024-11-14 05:51:08,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-14 05:51:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:08,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:08,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1626754875, now seen corresponding path program 1 times [2024-11-14 05:51:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:08,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028330147] [2024-11-14 05:51:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:08,494 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:08,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 05:51:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:08,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:51:08,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:08,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:08,846 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 [2024-11-14 05:51:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:51:08,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:51:08,883 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028330147] [2024-11-14 05:51:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028330147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:08,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:08,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:51:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104896068] [2024-11-14 05:51:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:51:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:51:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:08,885 INFO L87 Difference]: Start difference. First operand 311 states and 386 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-14 05:51:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:08,985 INFO L93 Difference]: Finished difference Result 565 states and 704 transitions. [2024-11-14 05:51:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:51:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 67 [2024-11-14 05:51:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:08,988 INFO L225 Difference]: With dead ends: 565 [2024-11-14 05:51:08,988 INFO L226 Difference]: Without dead ends: 311 [2024-11-14 05:51:08,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:51:08,989 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:08,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:51:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-14 05:51:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-14 05:51:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 274 states have (on average 1.2153284671532847) internal successors, (333), 277 states have internal predecessors, (333), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:51:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 381 transitions. [2024-11-14 05:51:09,032 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 381 transitions. Word has length 67 [2024-11-14 05:51:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:09,032 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 381 transitions. [2024-11-14 05:51:09,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2024-11-14 05:51:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 381 transitions. [2024-11-14 05:51:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 05:51:09,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:09,034 INFO L215 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, 1, 1, 1] [2024-11-14 05:51:09,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 05:51:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:09,235 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:09,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 862774087, now seen corresponding path program 1 times [2024-11-14 05:51:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:09,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836281339] [2024-11-14 05:51:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:09,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:09,240 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:09,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:09,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:51:09,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:09,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-14 05:51:09,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:09,771 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 66 treesize of output 30 [2024-11-14 05:51:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:51:09,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:51:09,860 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836281339] [2024-11-14 05:51:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836281339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:51:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243772622] [2024-11-14 05:51:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:51:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:51:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:51:09,861 INFO L87 Difference]: Start difference. First operand 311 states and 381 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2024-11-14 05:51:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:10,545 INFO L93 Difference]: Finished difference Result 540 states and 663 transitions. [2024-11-14 05:51:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:51:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 67 [2024-11-14 05:51:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:10,549 INFO L225 Difference]: With dead ends: 540 [2024-11-14 05:51:10,549 INFO L226 Difference]: Without dead ends: 326 [2024-11-14 05:51:10,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:51:10,550 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:10,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 293 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 05:51:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-14 05:51:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 316. [2024-11-14 05:51:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 282 states have internal predecessors, (338), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:51:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 386 transitions. [2024-11-14 05:51:10,594 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 386 transitions. Word has length 67 [2024-11-14 05:51:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:10,595 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 386 transitions. [2024-11-14 05:51:10,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2024-11-14 05:51:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 386 transitions. [2024-11-14 05:51:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 05:51:10,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:10,596 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 05:51:10,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 05:51:10,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:10,797 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1719901996, now seen corresponding path program 1 times [2024-11-14 05:51:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:10,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808620259] [2024-11-14 05:51:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:10,799 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:10,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-14 05:51:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:11,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:51:11,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:11,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:11,067 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 [2024-11-14 05:51:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 05:51:11,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:51:11,105 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:11,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808620259] [2024-11-14 05:51:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808620259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:11,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:51:11,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:51:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851056251] [2024-11-14 05:51:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:11,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:51:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:51:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:51:11,107 INFO L87 Difference]: Start difference. First operand 316 states and 386 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-14 05:51:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:11,494 INFO L93 Difference]: Finished difference Result 518 states and 631 transitions. [2024-11-14 05:51:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:51:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 69 [2024-11-14 05:51:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:11,496 INFO L225 Difference]: With dead ends: 518 [2024-11-14 05:51:11,496 INFO L226 Difference]: Without dead ends: 281 [2024-11-14 05:51:11,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:51:11,497 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:11,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:51:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-14 05:51:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-14 05:51:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 244 states have (on average 1.180327868852459) internal successors, (288), 247 states have internal predecessors, (288), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:51:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2024-11-14 05:51:11,533 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 69 [2024-11-14 05:51:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2024-11-14 05:51:11,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-11-14 05:51:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2024-11-14 05:51:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:51:11,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:11,536 INFO L215 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:11,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:11,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:11,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:11,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 215828791, now seen corresponding path program 1 times [2024-11-14 05:51:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169470803] [2024-11-14 05:51:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:11,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:11,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:11,741 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:11,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:51:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:12,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:51:12,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:12,163 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 [2024-11-14 05:51:16,783 INFO L349 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2024-11-14 05:51:16,784 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 88 treesize of output 96 [2024-11-14 05:51:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 137 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:51:19,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:31,704 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-14 05:51:31,704 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 92 treesize of output 1 [2024-11-14 05:51:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-14 05:51:31,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:31,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169470803] [2024-11-14 05:51:31,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169470803] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:31,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:51:31,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 30 [2024-11-14 05:51:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911076744] [2024-11-14 05:51:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:31,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:51:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:31,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:51:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2024-11-14 05:51:31,756 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:51:53,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 05:52:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:52:17,094 INFO L93 Difference]: Finished difference Result 745 states and 880 transitions. [2024-11-14 05:52:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 05:52:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-14 05:52:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:52:17,097 INFO L225 Difference]: With dead ends: 745 [2024-11-14 05:52:17,097 INFO L226 Difference]: Without dead ends: 553 [2024-11-14 05:52:17,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=481, Invalid=3179, Unknown=0, NotChecked=0, Total=3660 [2024-11-14 05:52:17,099 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:52:17,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 522 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-14 05:52:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-14 05:52:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 348. [2024-11-14 05:52:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.157190635451505) internal successors, (346), 303 states have internal predecessors, (346), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-14 05:52:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 410 transitions. [2024-11-14 05:52:17,161 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 410 transitions. Word has length 125 [2024-11-14 05:52:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:52:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 410 transitions. [2024-11-14 05:52:17,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:52:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 410 transitions. [2024-11-14 05:52:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:52:17,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:52:17,164 INFO L215 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:52:17,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:52:17,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:52:17,364 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:52:17,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:52:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash 242894393, now seen corresponding path program 1 times [2024-11-14 05:52:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:52:17,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673255397] [2024-11-14 05:52:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:52:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:52:17,367 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:52:17,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:52:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:17,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:52:17,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:18,021 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 [2024-11-14 05:52:18,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:52:18,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:52:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:52:19,170 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 66 treesize of output 44 [2024-11-14 05:52:19,367 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 66 treesize of output 62 [2024-11-14 05:52:19,375 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 56 treesize of output 55 [2024-11-14 05:52:19,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:19,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2024-11-14 05:52:20,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:20,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 43 [2024-11-14 05:52:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 21 proven. 117 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:52:21,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:52:22,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvslt (let ((.cse0 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_658) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))))) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_658) |c_~#unsigned_char_Array_0~0.base| (store .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) .cse1)) |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) ((_ zero_extend 24) ((_ extract 7 0) .cse1))))) (_ bv10 32)))) is different from false [2024-11-14 05:52:25,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:52:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673255397] [2024-11-14 05:52:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673255397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:52:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [938750412] [2024-11-14 05:52:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:25,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:52:25,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:52:25,854 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:52:25,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 05:52:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:27,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 05:52:27,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:27,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:52:28,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:52:29,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 05:52:29,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:52:30,140 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 53 treesize of output 43 [2024-11-14 05:52:30,151 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 39 treesize of output 33 [2024-11-14 05:52:30,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-11-14 05:52:30,574 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 46 treesize of output 42 [2024-11-14 05:52:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2024-11-14 05:52:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-14 05:52:35,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:52:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [938750412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:52:35,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:52:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 25 [2024-11-14 05:52:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243187194] [2024-11-14 05:52:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:52:35,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:52:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:52:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:52:35,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1099, Unknown=2, NotChecked=68, Total=1332 [2024-11-14 05:52:35,480 INFO L87 Difference]: Start difference. First operand 348 states and 410 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:52:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:52:41,060 INFO L93 Difference]: Finished difference Result 781 states and 921 transitions. [2024-11-14 05:52:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:52:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-14 05:52:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:52:41,064 INFO L225 Difference]: With dead ends: 781 [2024-11-14 05:52:41,064 INFO L226 Difference]: Without dead ends: 436 [2024-11-14 05:52:41,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=294, Invalid=1430, Unknown=2, NotChecked=80, Total=1806 [2024-11-14 05:52:41,067 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 273 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:52:41,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 398 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-14 05:52:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-14 05:52:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 348. [2024-11-14 05:52:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.1505016722408026) internal successors, (344), 303 states have internal predecessors, (344), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-14 05:52:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 408 transitions. [2024-11-14 05:52:41,113 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 408 transitions. Word has length 125 [2024-11-14 05:52:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:52:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 408 transitions. [2024-11-14 05:52:41,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-14 05:52:41,114 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 408 transitions. [2024-11-14 05:52:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:52:41,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:52:41,115 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:52:41,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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 [2024-11-14 05:52:41,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-14 05:52:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -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_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:52:41,516 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:52:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:52:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1636236553, now seen corresponding path program 1 times [2024-11-14 05:52:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:52:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607665824] [2024-11-14 05:52:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:52:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:52:41,519 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:52:41,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-14 05:52:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:42,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 05:52:42,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:42,220 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 [2024-11-14 05:52:43,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:52:43,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:52:43,212 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2024-11-14 05:52:43,222 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 35 treesize of output 36 [2024-11-14 05:52:43,319 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 35 treesize of output 31 [2024-11-14 05:52:43,335 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 6 treesize of output 4 [2024-11-14 05:52:43,991 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 37 treesize of output 17 [2024-11-14 05:52:44,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:52:45,284 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 54 treesize of output 47 [2024-11-14 05:52:45,422 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 67 treesize of output 59 [2024-11-14 05:52:45,571 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 107 treesize of output 73 [2024-11-14 05:52:45,861 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 137 treesize of output 117 [2024-11-14 05:52:45,881 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 136 treesize of output 125 [2024-11-14 05:52:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:52:46,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:53:04,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:53:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607665824] [2024-11-14 05:53:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607665824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1217728652] [2024-11-14 05:53:04,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:04,832 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:53:04,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:53:04,833 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:53:04,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-14 05:53:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:06,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:53:06,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:06,799 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 [2024-11-14 05:53:08,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:53:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:53:08,929 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 32 treesize of output 25 [2024-11-14 05:53:08,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:53:09,987 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 34 treesize of output 18 [2024-11-14 05:53:11,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 12 treesize of output 8 [2024-11-14 05:53:13,309 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 47 treesize of output 38 [2024-11-14 05:53:13,691 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 48 treesize of output 46 [2024-11-14 05:53:14,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2024-11-14 05:53:14,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 107 [2024-11-14 05:53:14,865 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 137 treesize of output 128 [2024-11-14 05:53:15,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 146 [2024-11-14 05:53:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 161 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-14 05:53:15,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:53:21,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_811))) (let ((.cse6 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse4 ((_ extract 7 0) (select .cse6 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse5 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_811) |c_~#unsigned_char_Array_0~0.base| (store .cse6 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse4))))) (let ((.cse1 (select .cse5 |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) (select .cse1 |c_~#signed_short_int_Array_0~0.offset|)))) (.cse2 (select (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (or (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse1 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse2 .cse3)))) (not (bvslt (bvshl (_ bv10 32) .cse3) (bvmul .cse2 ((_ zero_extend 24) .cse4)))))))))))) is different from false [2024-11-14 05:54:58,559 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:54:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1217728652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:54:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950781123] [2024-11-14 05:54:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:54:58,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:54:58,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:54:58,562 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:54:58,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 05:54:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:54:58,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-14 05:54:58,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:54:58,987 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 [2024-11-14 05:55:07,252 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 41 treesize of output 21 [2024-11-14 05:55:08,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:55:10,472 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 42 treesize of output 35 [2024-11-14 05:55:11,839 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 55 treesize of output 47 [2024-11-14 05:55:12,709 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 90 treesize of output 62 [2024-11-14 05:55:14,953 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 85 treesize of output 81 [2024-11-14 05:55:14,966 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 73 treesize of output 72 [2024-11-14 05:55:16,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:55:16,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 88 [2024-11-14 05:55:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 155 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-14 05:55:18,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:55:36,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_858) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse2 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_858) |c_~#unsigned_char_Array_0~0.base| (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse1))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul ((_ zero_extend 24) .cse1) (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))) (not (bvsle .cse0 (_ bv16 32))))))))) is different from false [2024-11-14 05:56:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950781123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:56:40,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:56:40,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 19] total 41 [2024-11-14 05:56:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436784372] [2024-11-14 05:56:40,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:56:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 05:56:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:56:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 05:56:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=4160, Unknown=62, NotChecked=270, Total=4970 [2024-11-14 05:56:40,511 INFO L87 Difference]: Start difference. First operand 348 states and 408 transitions. Second operand has 42 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 7 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-14 05:57:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:57:33,891 INFO L93 Difference]: Finished difference Result 1110 states and 1302 transitions. [2024-11-14 05:57:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 05:57:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 7 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 125 [2024-11-14 05:57:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:57:33,896 INFO L225 Difference]: With dead ends: 1110 [2024-11-14 05:57:33,896 INFO L226 Difference]: Without dead ends: 918 [2024-11-14 05:57:33,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 383 SyntacticMatches, 4 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3541 ImplicationChecksByTransitivity, 215.5s TimeCoverageRelationStatistics Valid=1762, Invalid=11756, Unknown=62, NotChecked=462, Total=14042 [2024-11-14 05:57:33,900 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 589 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 4497 mSolverCounterSat, 95 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 4497 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:57:33,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 2303 Invalid, 4600 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 4497 Invalid, 8 Unknown, 0 Unchecked, 27.5s Time] [2024-11-14 05:57:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-14 05:57:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 725. [2024-11-14 05:57:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 630 states have (on average 1.1523809523809523) internal successors, (726), 639 states have internal predecessors, (726), 62 states have call successors, (62), 32 states have call predecessors, (62), 32 states have return successors, (62), 53 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-14 05:57:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 850 transitions. [2024-11-14 05:57:34,028 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 850 transitions. Word has length 125 [2024-11-14 05:57:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:57:34,029 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 850 transitions. [2024-11-14 05:57:34,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 7 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-14 05:57:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 850 transitions. [2024-11-14 05:57:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 05:57:34,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:57:34,030 INFO L215 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:57:34,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-14 05:57:34,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-14 05:57:34,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-14 05:57:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:57:34,631 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:57:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:57:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1213534727, now seen corresponding path program 1 times [2024-11-14 05:57:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:57:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48556629] [2024-11-14 05:57:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:57:34,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:57:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:57:34,634 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:57:34,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-14 05:57:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:57:35,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 05:57:35,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:57:35,387 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 [2024-11-14 05:57:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:57:36,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:57:36,991 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 32 treesize of output 25 [2024-11-14 05:57:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:57:38,065 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 34 treesize of output 18 [2024-11-14 05:57:39,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:57:40,191 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 54 treesize of output 47 [2024-11-14 05:57:40,332 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 67 treesize of output 59 [2024-11-14 05:57:40,594 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 80 treesize of output 78 [2024-11-14 05:57:40,623 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 79 treesize of output 74 [2024-11-14 05:57:40,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:57:40,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 89 [2024-11-14 05:57:41,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:57:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 64 [2024-11-14 05:57:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:57:41,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:57:42,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_906))) (or (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (let ((.cse3 (select .cse0 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse1 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_906) |c_~#unsigned_char_Array_0~0.base| (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse2))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul ((_ zero_extend 24) .cse2) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2024-11-14 05:57:43,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))))) (let ((.cse4 (store (store .cse2 |c_~#unsigned_char_Array_0~0.base| (store (select .cse2 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_906))) (or (not (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse0 (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_906) |c_~#unsigned_char_Array_0~0.base| (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse1))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse1))))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))) is different from false [2024-11-14 05:57:43,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse6 ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite6#1|)))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset| .cse6)))) (store .cse5 |c_~#signed_long_int_Array_0~0.base| (store (select .cse5 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) .cse6)))))))) (let ((.cse4 (store (store .cse2 |c_~#unsigned_char_Array_0~0.base| (store (select .cse2 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_906))) (or (not (let ((.cse3 (select .cse4 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse0 (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_906) |c_~#unsigned_char_Array_0~0.base| (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse1))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul ((_ zero_extend 24) .cse1) (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse4 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))) is different from false [2024-11-14 05:57:51,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))) (.cse22 ((_ sign_extend 16) c_~last_1_signed_short_int_Array_0_0_~0))) (let ((.cse12 (bvsgt c_~last_1_signed_long_int_Array_0_0_~0 .cse22)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse5))))) (let ((.cse11 (bvadd (bvneg .cse22) .cse22 .cse23)) (.cse21 (bvadd (bvneg c_~last_1_signed_long_int_Array_0_0_~0) .cse22 .cse23)) (.cse13 (not .cse12))) (or (let ((.cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))) (.cse7 ((_ sign_extend 24) (_ bv64 8))) (.cse10 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|))) (and (or (forall ((v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse9 ((_ sign_extend 16) ((_ extract 15 0) .cse11)))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse10 |c_~#signed_short_int_Array_0~0.offset| .cse9)))) (store .cse8 |c_~#signed_long_int_Array_0~0.base| (store (select .cse8 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) .cse9)))))))) (let ((.cse6 (store (store .cse2 |c_~#unsigned_char_Array_0~0.base| (store (select .cse2 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse7)) |c_~#double_Array_0~0.base| v_ArrVal_906))) (or (not (let ((.cse3 (select .cse6 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse3 .cse5)))) (let ((.cse0 (store (store .cse2 |c_~#double_Array_0~0.base| v_ArrVal_906) |c_~#unsigned_char_Array_0~0.base| (store .cse3 .cse4 ((_ sign_extend 24) .cse1))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul ((_ zero_extend 24) .cse1) (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))))))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse6 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))) .cse12) (or .cse13 (forall ((v_ArrVal_906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (let ((.cse20 ((_ sign_extend 16) ((_ extract 15 0) .cse21)))) (let ((.cse19 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse10 |c_~#signed_short_int_Array_0~0.offset| .cse20)))) (store .cse19 |c_~#signed_long_int_Array_0~0.base| (store (select .cse19 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) .cse20)))))))) (let ((.cse14 (store (store .cse17 |c_~#unsigned_char_Array_0~0.base| (store (select .cse17 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse7)) |c_~#double_Array_0~0.base| v_ArrVal_906))) (or (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse14 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (let ((.cse18 (select .cse14 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse16 ((_ extract 7 0) (select .cse18 .cse5)))) (let ((.cse15 (store (store .cse17 |c_~#double_Array_0~0.base| v_ArrVal_906) |c_~#unsigned_char_Array_0~0.base| (store .cse18 .cse4 ((_ sign_extend 24) .cse16))))) (bvslt (bvshl (_ bv10 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse15 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|)))) (bvmul (select (select .cse15 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse16)))))))))))))) (and (or (forall ((~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt .cse11 ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0)))) .cse12) (or (forall ((~last_1_unsigned_char_Array_0_2_~0 (_ BitVec 8))) (not (bvsgt .cse21 ((_ zero_extend 24) ~last_1_unsigned_char_Array_0_2_~0)))) .cse13)))))) is different from false [2024-11-14 05:57:54,278 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:57:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48556629] [2024-11-14 05:57:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48556629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:57:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1519492094] [2024-11-14 05:57:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:57:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:57:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:57:54,281 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:57:54,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-14 05:57:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:57:55,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 05:57:55,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:57:56,212 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 [2024-11-14 05:57:58,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:57:58,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 05:57:58,909 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 32 treesize of output 25 [2024-11-14 05:57:58,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 05:58:00,402 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 34 treesize of output 18 [2024-11-14 05:58:02,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:58:03,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2024-11-14 05:58:03,527 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 43 treesize of output 41 [2024-11-14 05:58:03,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2024-11-14 05:58:03,948 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 [2024-11-14 05:58:04,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2024-11-14 05:58:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 9 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:58:06,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:58:10,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_955))) (let ((.cse4 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse2 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_955) |c_~#unsigned_char_Array_0~0.base| (store .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse1))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul ((_ zero_extend 24) .cse1) (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32)))))))))) is different from false [2024-11-14 05:58:23,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 ((_ sign_extend 16) c_~last_1_signed_short_int_Array_0_0_~0)) (.cse7 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))) (let ((.cse6 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))) (.cse8 ((_ sign_extend 24) (_ bv64 8))) (.cse11 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|)) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) .cse7)))) (.cse14 (bvsgt c_~last_1_signed_long_int_Array_0_0_~0 .cse12))) (and (or (forall ((v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse10 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse12) .cse12 .cse13))))) (let ((.cse9 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse11 |c_~#signed_short_int_Array_0~0.offset| .cse10)))) (store .cse9 |c_~#signed_long_int_Array_0~0.base| (store (select .cse9 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) .cse10)))))))) (let ((.cse3 (store (store .cse4 |c_~#unsigned_char_Array_0~0.base| (store (select .cse4 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse8)) |c_~#double_Array_0~0.base| v_ArrVal_955))) (let ((.cse5 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ extract 7 0) (select .cse5 .cse7)))) (let ((.cse1 (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_955) |c_~#unsigned_char_Array_0~0.base| (store .cse5 .cse6 ((_ sign_extend 24) .cse2))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse2)))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))))))) .cse14) (or (forall ((v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (let ((.cse22 ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg c_~last_1_signed_long_int_Array_0_0_~0) .cse12 .cse13))))) (let ((.cse21 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store .cse11 |c_~#signed_short_int_Array_0~0.offset| .cse22)))) (store .cse21 |c_~#signed_long_int_Array_0~0.base| (store (select .cse21 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset| ((_ sign_extend 16) ((_ extract 15 0) .cse22)))))))) (let ((.cse18 (store (store .cse19 |c_~#unsigned_char_Array_0~0.base| (store (select .cse19 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| .cse8)) |c_~#double_Array_0~0.base| v_ArrVal_955))) (let ((.cse20 (select .cse18 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse17 ((_ extract 7 0) (select .cse20 .cse7)))) (let ((.cse16 (store (store .cse19 |c_~#double_Array_0~0.base| v_ArrVal_955) |c_~#unsigned_char_Array_0~0.base| (store .cse20 .cse6 ((_ sign_extend 24) .cse17))))) (let ((.cse15 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse16 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvslt (bvshl (_ bv10 32) .cse15) (bvmul (select (select .cse16 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse17)))) (not (bvsle .cse15 (_ bv16 32))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse18 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))))))))))) (not .cse14))))) is different from false [2024-11-14 05:58:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1519492094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:58:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317934606] [2024-11-14 05:58:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:58:27,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:58:27,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:58:27,937 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:58:27,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 05:58:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:58:28,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 05:58:28,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:58:28,602 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 [2024-11-14 05:58:34,832 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 41 treesize of output 21 [2024-11-14 05:58:35,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:58:36,657 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 54 treesize of output 47 [2024-11-14 05:58:36,718 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 67 treesize of output 59 [2024-11-14 05:58:38,403 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 106 treesize of output 90 [2024-11-14 05:58:38,413 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 137 treesize of output 126 [2024-11-14 05:58:39,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:58:39,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 124 [2024-11-14 05:58:42,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:58:42,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 64 [2024-11-14 05:58:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 128 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 05:58:42,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:58:44,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_999) |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse2 ((_ extract 7 0) (select .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse1 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_999) |c_~#unsigned_char_Array_0~0.base| (store .cse3 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse2))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse2)))))))))) is different from false [2024-11-14 05:59:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317934606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:59:44,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:59:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 21] total 35 [2024-11-14 05:59:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073332974] [2024-11-14 05:59:44,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:59:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:59:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:59:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:59:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2212, Unknown=51, NotChecked=728, Total=3306 [2024-11-14 05:59:44,625 INFO L87 Difference]: Start difference. First operand 725 states and 850 transitions. Second operand has 36 states, 36 states have (on average 5.027777777777778) internal successors, (181), 35 states have internal predecessors, (181), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-14 06:00:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 06:00:25,322 INFO L93 Difference]: Finished difference Result 1307 states and 1538 transitions. [2024-11-14 06:00:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-14 06:00:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.027777777777778) internal successors, (181), 35 states have internal predecessors, (181), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 125 [2024-11-14 06:00:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 06:00:25,327 INFO L225 Difference]: With dead ends: 1307 [2024-11-14 06:00:25,327 INFO L226 Difference]: Without dead ends: 885 [2024-11-14 06:00:25,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 394 SyntacticMatches, 6 SemanticMatches, 107 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 112.8s TimeCoverageRelationStatistics Valid=1631, Invalid=8646, Unknown=53, NotChecked=1442, Total=11772 [2024-11-14 06:00:25,332 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 720 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-11-14 06:00:25,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1855 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 20.6s Time] [2024-11-14 06:00:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-14 06:00:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 759. [2024-11-14 06:00:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 664 states have (on average 1.1566265060240963) internal successors, (768), 673 states have internal predecessors, (768), 62 states have call successors, (62), 32 states have call predecessors, (62), 32 states have return successors, (62), 53 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-14 06:00:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 892 transitions. [2024-11-14 06:00:25,468 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 892 transitions. Word has length 125 [2024-11-14 06:00:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 06:00:25,468 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 892 transitions. [2024-11-14 06:00:25,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.027777777777778) internal successors, (181), 35 states have internal predecessors, (181), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-14 06:00:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 892 transitions. [2024-11-14 06:00:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 06:00:25,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 06:00:25,471 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 06:00:25,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-14 06:00:25,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-14 06:00:25,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-14 06:00:26,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 06:00:26,072 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 06:00:26,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 06:00:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1770250059, now seen corresponding path program 1 times [2024-11-14 06:00:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 06:00:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747408528] [2024-11-14 06:00:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 06:00:26,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 06:00:26,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 06:00:26,076 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 06:00:26,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-14 06:00:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 06:00:26,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 06:00:26,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 06:00:26,817 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 [2024-11-14 06:00:28,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 06:00:28,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 06:00:28,444 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 32 treesize of output 25 [2024-11-14 06:00:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-14 06:00:29,937 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 38 treesize of output 22 [2024-11-14 06:00:30,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 06:00:31,847 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 42 treesize of output 41 [2024-11-14 06:00:32,075 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 65 treesize of output 41 [2024-11-14 06:00:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 19 proven. 119 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-14 06:00:32,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 06:00:41,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 06:00:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747408528] [2024-11-14 06:00:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747408528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 06:00:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [960534696] [2024-11-14 06:00:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 06:00:41,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 06:00:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 06:00:41,752 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 06:00:41,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-14 06:00:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 06:00:43,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-14 06:00:43,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 06:00:43,651 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 [2024-11-14 06:00:46,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 06:00:46,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 06:00:46,841 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 [2024-11-14 06:00:47,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2024-11-14 06:00:50,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 39 [2024-11-14 06:00:52,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-14 06:00:55,746 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 50 treesize of output 45 [2024-11-14 06:00:56,187 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 47 treesize of output 27 [2024-11-14 06:00:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 43 proven. 119 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-14 06:00:56,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 06:01:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [960534696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 06:01:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869614951] [2024-11-14 06:01:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 06:01:08,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 06:01:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 06:01:08,396 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 06:01:08,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50652df7-38b2-4a09-92de-e803cd3a42d2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 06:01:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 06:01:08,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 06:01:08,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 06:01:08,947 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 [2024-11-14 06:01:19,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 06:01:19,481 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 96 treesize of output 44 [2024-11-14 06:01:22,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 06:01:27,410 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 48 treesize of output 41 [2024-11-14 06:01:28,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-14 06:01:28,991 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 54 treesize of output 40 [2024-11-14 06:01:29,894 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 52 treesize of output 56 [2024-11-14 06:01:29,927 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 51 treesize of output 48 [2024-11-14 06:01:30,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 06:01:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 67 [2024-11-14 06:01:32,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 06:01:32,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2024-11-14 06:01:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 152 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-14 06:01:34,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 06:01:43,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_1139))) (let ((.cse4 (select .cse3 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse1 ((_ extract 7 0) (select .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse2 (store (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_1139) |c_~#unsigned_char_Array_0~0.base| (store .cse4 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse1))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul ((_ zero_extend 24) .cse1) (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse3 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32)))))))))) is different from false [2024-11-14 06:01:43,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (_ BitVec 32)) (v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)) v_ArrVal_1137)))) (let ((.cse1 (store (store .cse4 |c_~#unsigned_char_Array_0~0.base| (store (select .cse4 |c_~#unsigned_char_Array_0~0.base|) |c_~#unsigned_char_Array_0~0.offset| ((_ sign_extend 24) (_ bv64 8)))) |c_~#double_Array_0~0.base| v_ArrVal_1139))) (let ((.cse5 (select .cse1 |c_~#unsigned_char_Array_0~0.base|))) (let ((.cse3 ((_ extract 7 0) (select .cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32)))))) (let ((.cse2 (store (store .cse4 |c_~#double_Array_0~0.base| v_ArrVal_1139) |c_~#unsigned_char_Array_0~0.base| (store .cse5 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32)) ((_ sign_extend 24) .cse3))))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))))) (or (not (bvsle .cse0 (_ bv16 32))) (not (bvsle ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) |c_~#signed_short_int_Array_0~0.offset|))) (_ bv16 32))) (not (bvslt (bvshl (_ bv10 32) .cse0) (bvmul (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|) ((_ zero_extend 24) .cse3)))))))))))) is different from false