./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:10:05,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:10:05,309 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:10:05,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:10:05,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:10:05,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:10:05,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:10:05,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:10:05,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:10:05,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:10:05,351 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:10:05,351 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:10:05,352 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:10:05,352 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:10:05,352 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:10:05,352 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:10:05,352 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:10:05,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:10:05,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:10:05,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:10:05,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:10:05,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:10:05,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:10:05,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:10:05,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:10:05,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:10:05,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:10:05,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:10:05,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:10:05,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:10:05,357 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:10:05,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:10:05,357 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 -> 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 [2024-11-14 03:10:05,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:10:05,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:10:05,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:10:05,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:10:05,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:10:05,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i Unable to find full path for "g++" [2024-11-14 03:10:08,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:10:08,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:10:08,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i [2024-11-14 03:10:08,733 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/db908cdd2/422a830af7ea4fbba1b04515fe3ccf0f/FLAG301f0e353 [2024-11-14 03:10:08,756 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/db908cdd2/422a830af7ea4fbba1b04515fe3ccf0f [2024-11-14 03:10:08,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:10:08,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:10:08,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:10:08,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:10:08,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:10:08,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:10:08" (1/1) ... [2024-11-14 03:10:08,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243710bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:08, skipping insertion in model container [2024-11-14 03:10:08,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:10:08" (1/1) ... [2024-11-14 03:10:08,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:10:09,053 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-14 03:10:09,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:10:09,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:10:09,192 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-14 03:10:09,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:10:09,316 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:10:09,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09 WrapperNode [2024-11-14 03:10:09,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:10:09,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:10:09,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:10:09,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:10:09,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,422 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-14 03:10:09,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:10:09,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:10:09,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:10:09,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:10:09,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:10:09,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:10:09,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:10:09,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:10:09,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (1/1) ... [2024-11-14 03:10:09,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:10:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:10:09,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:10:09,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 03:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 03:10:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 03:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:10:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:10:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:10:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:10:09,763 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:10:09,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:10:10,627 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-14 03:10:10,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:10:11,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:10:11,652 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:10:11,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:10:11 BoogieIcfgContainer [2024-11-14 03:10:11,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:10:11,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:10:11,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:10:11,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:10:11,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:10:08" (1/3) ... [2024-11-14 03:10:11,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2410ebc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:10:11, skipping insertion in model container [2024-11-14 03:10:11,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:09" (2/3) ... [2024-11-14 03:10:11,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2410ebc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:10:11, skipping insertion in model container [2024-11-14 03:10:11,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:10:11" (3/3) ... [2024-11-14 03:10:11,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-40.i [2024-11-14 03:10:11,691 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:10:11,696 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-40.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:10:11,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:10:11,808 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;@4bb9808f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:10:11,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:10:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 03:10:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-14 03:10:11,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:11,832 INFO L215 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:11,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash 309656927, now seen corresponding path program 1 times [2024-11-14 03:10:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:10:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855551893] [2024-11-14 03:10:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:10:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 03:10:14,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62834747] [2024-11-14 03:10:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:10:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:10:14,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:10:14,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:10:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:10:16,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:10:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:10:17,402 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:10:17,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:10:17,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:10:17,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:10:17,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 03:10:17,617 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:10:17,776 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:10:17,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:10:17 BoogieIcfgContainer [2024-11-14 03:10:17,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:10:17,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:10:17,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:10:17,788 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:10:17,789 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:10:11" (3/4) ... [2024-11-14 03:10:17,792 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:10:17,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:10:17,795 INFO L158 Benchmark]: Toolchain (without parser) took 9032.74ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 104.7MB in the beginning and 280.2MB in the end (delta: -175.5MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2024-11-14 03:10:17,799 INFO L158 Benchmark]: CDTParser took 1.72ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:10:17,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.83ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:10:17,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.21ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:10:17,800 INFO L158 Benchmark]: Boogie Preprocessor took 81.67ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:10:17,801 INFO L158 Benchmark]: RCFGBuilder took 2143.61ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 83.7MB in the beginning and 330.3MB in the end (delta: -246.6MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-11-14 03:10:17,801 INFO L158 Benchmark]: TraceAbstraction took 6127.34ms. Allocated memory is still 369.1MB. Free memory was 329.5MB in the beginning and 280.3MB in the end (delta: 49.3MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-14 03:10:17,802 INFO L158 Benchmark]: Witness Printer took 6.49ms. Allocated memory is still 369.1MB. Free memory was 280.3MB in the beginning and 280.2MB in the end (delta: 71.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:10:17,804 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.72ms. Allocated memory is still 167.8MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.83ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.21ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.67ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2143.61ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 83.7MB in the beginning and 330.3MB in the end (delta: -246.6MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6127.34ms. Allocated memory is still 369.1MB. Free memory was 329.5MB in the beginning and 280.3MB in the end (delta: 49.3MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * Witness Printer took 6.49ms. Allocated memory is still 369.1MB. Free memory was 280.3MB in the beginning and 280.2MB in the end (delta: 71.9kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of bitwiseOr at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 8.4, 49.75 }; [L28-L30] float float_Array_0[1] = { 7.5 }; [L31-L33] signed char signed_char_Array_0[3] = { -2, 25, -5 }; [L34-L36] signed long int signed_long_int_Array_0[3] = { -10, -2, -4 }; [L37-L39] signed short int signed_short_int_Array_0[2] = { 1, -256 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 1, 64, 128 }; [L43] double last_1_double_Array_0_0_ = 8.4; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR double_Array_0[0] [L102] last_1_double_Array_0_0_ = double_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L73] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L73] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L74] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L74] 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}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L75] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L77] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L78] double_Array_0[1] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L79] EXPR double_Array_0[1] [L79] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L79] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L79] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L80] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L81] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L82] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L83] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L85] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L86] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L88] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L89] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L89] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L90] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L91] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(signed_long_int_Array_0[1] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L92] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L92] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L93] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L93] RET assume_abort_if_not(signed_long_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L94] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L97] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L98] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L99] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L20] COND FALSE !(!cond) [L99] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L113] RET updateVariables() [L114] CALL step() [L47] BOOL_unsigned_char_Array_0[0] [L47] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L50] EXPR double_Array_0[1] [L50] float_Array_0[0] = double_Array_0[1] [L51] EXPR signed_char_Array_0[0] [L51] signed_short_int_Array_0[0] = signed_char_Array_0[0] [L52] EXPR signed_char_Array_0[2] [L52] signed_short_int_Array_0[1] = signed_char_Array_0[2] [L53] BOOL_unsigned_char_Array_0[1] [L53] COND TRUE BOOL_unsigned_char_Array_0[1] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f)) [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) [L62] EXPR signed_char_Array_0[0] [L62] EXPR signed_long_int_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR signed_short_int_Array_0[1] [L62] EXPR signed_char_Array_0[0] [L62] EXPR signed_short_int_Array_0[1] | signed_char_Array_0[0] [L62] COND TRUE ((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0]) [L63] EXPR unsigned_char_Array_0[2] [L63] EXPR unsigned_char_Array_0[0] [L63] unsigned_char_Array_0[1] = (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] [L67] EXPR ((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0]) [L67] EXPR float_Array_0[0] [L67] EXPR ((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0]) [L67] COND TRUE float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0]))) [L68] EXPR double_Array_0[1] [L68] double_Array_0[0] = (double_Array_0[1] + (127.4 - 8.25)) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR BOOL_unsigned_char_Array_0[1] [L105] EXPR BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[0] [L105] EXPR BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f)) [L105] EXPR (BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1 [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L105] EXPR signed_char_Array_0[0] [L105] EXPR signed_long_int_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_short_int_Array_0[1] [L105] EXPR signed_char_Array_0[0] [L105] EXPR signed_short_int_Array_0[1] | signed_char_Array_0[0] [L105] EXPR (((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[0] [L105] EXPR (((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1) [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1]) > ((-2 + signed_char_Array_0[2]))) ? (signed_char_Array_0[1]) : ((-2 + signed_char_Array_0[2])))))) : 1) [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1]) > ((-2 + signed_char_Array_0[2]))) ? (signed_char_Array_0[1]) : ((-2 + signed_char_Array_0[2])))))) : 1)) && (float_Array_0[0] == ((float) double_Array_0[1])) [L105] EXPR (((((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1]) > ((-2 + signed_char_Array_0[2]))) ? (signed_char_Array_0[1]) : ((-2 + signed_char_Array_0[2])))))) : 1)) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0])) [L105] EXPR ((((((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1]) > ((-2 + signed_char_Array_0[2]))) ? (signed_char_Array_0[1]) : ((-2 + signed_char_Array_0[2])))))) : 1)) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0]))) && (signed_short_int_Array_0[1] == ((signed short int) signed_char_Array_0[2])) [L105-L106] return ((((((BOOL_unsigned_char_Array_0[1] ? ((BOOL_unsigned_char_Array_0[0] && (float_Array_0[0] <= (- 63.9f))) ? ((float_Array_0[0] >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[2] == ((signed long int) signed_short_int_Array_0[1])) : 1) : 1) : 1) : 1) && ((((signed_char_Array_0[0] / signed_long_int_Array_0[1]) / signed_long_int_Array_0[0]) >= (signed_short_int_Array_0[1] | signed_char_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && ((float_Array_0[0] != ((((last_1_double_Array_0_0_) < (float_Array_0[0])) ? (last_1_double_Array_0_0_) : (float_Array_0[0])))) ? (double_Array_0[0] == ((double) (double_Array_0[1] + (127.4 - 8.25)))) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1]) > ((-2 + signed_char_Array_0[2]))) ? (signed_char_Array_0[1]) : ((-2 + signed_char_Array_0[2])))))) : 1)) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0]))) && (signed_short_int_Array_0[1] == ((signed short int) signed_char_Array_0[2])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=42/5, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, signed_short_int_Array_0={9:0}, unsigned_char_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 1, TraceHistogramMax: 19, 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=47occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 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 03:10:17,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:10:21,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:10:21,588 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:10:21,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:10:21,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:10:21,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:10:21,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:10:21,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:10:21,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:10:21,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:10:21,652 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:10:21,653 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:10:21,653 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:10:21,653 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:10:21,653 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:10:21,653 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:10:21,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:10:21,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:10:21,655 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:10:21,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:10:21,655 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:10:21,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:10:21,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:10:21,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:10:21,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:10:21,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:10:21,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:10:21,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:10:21,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:10:21,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:10:21,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:10:21,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:10:21,660 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:10:21,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:10:21,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:10:21,660 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:10:21,660 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 -> 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 [2024-11-14 03:10:22,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:10:22,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:10:22,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:10:22,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:10:22,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:10:22,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i Unable to find full path for "g++" [2024-11-14 03:10:24,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:10:24,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:10:24,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i [2024-11-14 03:10:25,007 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/f0561bede/355ff9dfbd554ae88025797b2fb03d48/FLAG862855e65 [2024-11-14 03:10:25,039 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/data/f0561bede/355ff9dfbd554ae88025797b2fb03d48 [2024-11-14 03:10:25,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:10:25,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:10:25,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:10:25,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:10:25,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:10:25,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2214f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25, skipping insertion in model container [2024-11-14 03:10:25,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:10:25,344 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-14 03:10:25,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:10:25,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:10:25,535 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_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-14 03:10:25,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:10:25,698 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:10:25,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25 WrapperNode [2024-11-14 03:10:25,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:10:25,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:10:25,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:10:25,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:10:25,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,827 INFO L138 Inliner]: procedures = 39, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-14 03:10:25,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:10:25,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:10:25,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:10:25,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:10:25,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:10:25,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:10:25,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:10:25,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:10:25,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (1/1) ... [2024-11-14 03:10:25,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:10:26,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:10:26,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:10:26,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:10:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:10:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 03:10:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 03:10:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:10:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 03:10:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-14 03:10:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-14 03:10:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:10:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:10:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:10:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:10:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 03:10:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 03:10:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:10:26,270 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:10:26,274 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:10:30,513 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-11-14 03:10:30,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:10:30,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:10:30,530 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:10:30,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:10:30 BoogieIcfgContainer [2024-11-14 03:10:30,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:10:30,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:10:30,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:10:30,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:10:30,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:10:25" (1/3) ... [2024-11-14 03:10:30,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19152801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:10:30, skipping insertion in model container [2024-11-14 03:10:30,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:10:25" (2/3) ... [2024-11-14 03:10:30,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19152801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:10:30, skipping insertion in model container [2024-11-14 03:10:30,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:10:30" (3/3) ... [2024-11-14 03:10:30,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-40.i [2024-11-14 03:10:30,561 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:10:30,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-40.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:10:30,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:10:30,677 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;@4e873b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:10:30,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:10:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 85 states have (on average 1.4) internal successors, (119), 86 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 03:10:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-14 03:10:30,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:30,705 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:30,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -731458730, now seen corresponding path program 1 times [2024-11-14 03:10:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:30,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558769786] [2024-11-14 03:10:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:30,731 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 03:10:30,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:30,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:30,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:31,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:10:31,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-14 03:10:31,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:10:31,499 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:10:31,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558769786] [2024-11-14 03:10:31,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558769786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:10:31,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:10:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:10:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292940291] [2024-11-14 03:10:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:10:31,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:10:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:10:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:10:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:10:31,538 INFO L87 Difference]: Start difference. First operand has 107 states, 85 states have (on average 1.4) internal successors, (119), 86 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-14 03:10:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:31,581 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-11-14 03:10:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:10:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-14 03:10:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:31,593 INFO L225 Difference]: With dead ends: 207 [2024-11-14 03:10:31,594 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 03:10:31,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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 03:10:31,602 INFO L432 NwaCegarLoop]: 150 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, 150 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 03:10:31,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:10:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 03:10:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-14 03:10:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-14 03:10:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-14 03:10:31,661 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2024-11-14 03:10:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:31,661 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-14 03:10:31,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-14 03:10:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-14 03:10:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-14 03:10:31,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:31,666 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:31,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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)] Ended with exit code 0 [2024-11-14 03:10:31,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:31,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:31,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2071746924, now seen corresponding path program 1 times [2024-11-14 03:10:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:31,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76684712] [2024-11-14 03:10:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:31,872 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 03:10:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:31,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:31,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:32,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:10:32,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:32,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:10:32,895 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 64 treesize of output 24 [2024-11-14 03:10:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-14 03:10:36,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:10:36,558 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:10:36,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76684712] [2024-11-14 03:10:36,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76684712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:10:36,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:10:36,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:10:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054700984] [2024-11-14 03:10:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:10:36,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:10:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:10:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:10:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:10:36,564 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:44,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:10:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:45,738 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2024-11-14 03:10:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:10:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-14 03:10:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:45,753 INFO L225 Difference]: With dead ends: 305 [2024-11-14 03:10:45,753 INFO L226 Difference]: Without dead ends: 205 [2024-11-14 03:10:45,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:10:45,755 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:10:45,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 399 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-14 03:10:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-14 03:10:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 167. [2024-11-14 03:10:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 126 states have internal predecessors, (168), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 03:10:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2024-11-14 03:10:45,809 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 149 [2024-11-14 03:10:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:45,810 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2024-11-14 03:10:45,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2024-11-14 03:10:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-14 03:10:45,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:45,814 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:45,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:10:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:46,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -534276630, now seen corresponding path program 1 times [2024-11-14 03:10:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844210142] [2024-11-14 03:10:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:46,018 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 03:10:46,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:46,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:46,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:46,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:10:46,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-14 03:10:46,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:10:46,762 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:10:46,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844210142] [2024-11-14 03:10:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844210142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:10:46,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:10:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:10:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336103190] [2024-11-14 03:10:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:10:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:10:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:10:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:10:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:10:46,767 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:46,867 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-11-14 03:10:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:10:46,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-14 03:10:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:46,872 INFO L225 Difference]: With dead ends: 269 [2024-11-14 03:10:46,872 INFO L226 Difference]: Without dead ends: 169 [2024-11-14 03:10:46,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 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 03:10:46,879 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:10:46,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:10:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-14 03:10:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-14 03:10:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 03:10:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 246 transitions. [2024-11-14 03:10:46,925 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 246 transitions. Word has length 149 [2024-11-14 03:10:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:46,926 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 246 transitions. [2024-11-14 03:10:46,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2024-11-14 03:10:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-14 03:10:46,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:46,936 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:46,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:10:47,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:47,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash 104553157, now seen corresponding path program 1 times [2024-11-14 03:10:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897171243] [2024-11-14 03:10:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:47,139 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 03:10:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:47,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:47,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:47,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:10:47,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-14 03:10:47,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:10:47,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:10:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897171243] [2024-11-14 03:10:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897171243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:10:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:10:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:10:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622847454] [2024-11-14 03:10:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:10:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:10:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:10:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:10:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:10:47,984 INFO L87 Difference]: Start difference. First operand 169 states and 246 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:48,388 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-11-14 03:10:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:10:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-14 03:10:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:48,392 INFO L225 Difference]: With dead ends: 278 [2024-11-14 03:10:48,392 INFO L226 Difference]: Without dead ends: 176 [2024-11-14 03:10:48,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:10:48,394 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:10:48,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 695 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:10:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-14 03:10:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2024-11-14 03:10:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 03:10:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 252 transitions. [2024-11-14 03:10:48,419 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 252 transitions. Word has length 151 [2024-11-14 03:10:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:48,420 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 252 transitions. [2024-11-14 03:10:48,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 252 transitions. [2024-11-14 03:10:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-14 03:10:48,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:48,428 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:48,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:48,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:48,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:48,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560519, now seen corresponding path program 1 times [2024-11-14 03:10:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:48,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462122591] [2024-11-14 03:10:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:48,630 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 03:10:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:48,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:48,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:49,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:10:49,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-14 03:10:49,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:10:49,477 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:10:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462122591] [2024-11-14 03:10:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462122591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:10:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:10:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:10:49,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852407543] [2024-11-14 03:10:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:10:49,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:10:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:10:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:10:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:10:49,480 INFO L87 Difference]: Start difference. First operand 175 states and 252 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:10:49,902 INFO L93 Difference]: Finished difference Result 286 states and 411 transitions. [2024-11-14 03:10:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:10:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-14 03:10:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:10:49,905 INFO L225 Difference]: With dead ends: 286 [2024-11-14 03:10:49,906 INFO L226 Difference]: Without dead ends: 178 [2024-11-14 03:10:49,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:10:49,911 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:10:49,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 827 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:10:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-14 03:10:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2024-11-14 03:10:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 136 states have internal predecessors, (178), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 03:10:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2024-11-14 03:10:49,955 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 151 [2024-11-14 03:10:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:10:49,957 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2024-11-14 03:10:49,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:10:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2024-11-14 03:10:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-14 03:10:49,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:10:49,960 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:49,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:50,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:50,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:10:50,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:10:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1881407561, now seen corresponding path program 1 times [2024-11-14 03:10:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:10:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693384385] [2024-11-14 03:10:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:10:50,162 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 03:10:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:10:50,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:50,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:10:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:10:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:10:51,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:10:51,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:10:51,624 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 56 treesize of output 20 [2024-11-14 03:10:56,828 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 121 treesize of output 94 [2024-11-14 03:10:58,645 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 121 treesize of output 94 [2024-11-14 03:11:00,700 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 121 treesize of output 94 [2024-11-14 03:11:02,903 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 121 treesize of output 94 [2024-11-14 03:11:05,125 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 121 treesize of output 94 [2024-11-14 03:11:06,371 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 121 treesize of output 94 [2024-11-14 03:11:07,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:07,950 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 1 case distinctions, treesize of input 188 treesize of output 97 [2024-11-14 03:11:07,959 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 192 treesize of output 152 [2024-11-14 03:11:13,265 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 192 treesize of output 152 [2024-11-14 03:11:16,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:16,981 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 205 treesize of output 73 [2024-11-14 03:11:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 476 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 03:11:20,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:11:26,489 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_183) |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2024-11-14 03:11:52,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:11:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693384385] [2024-11-14 03:11:52,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693384385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:11:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2000547373] [2024-11-14 03:11:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:11:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:11:52,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:11:52,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:11:52,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 03:11:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:11:55,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:11:55,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:11:56,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:56,409 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 64 treesize of output 24 [2024-11-14 03:11:58,919 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 03:12:07,762 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 03:12:09,595 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 03:12:12,936 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 03:12:15,362 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 03:12:18,945 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 03:12:20,431 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 03:12:22,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:12:22,337 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 1 case distinctions, treesize of input 208 treesize of output 105 [2024-11-14 03:12:22,347 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 212 treesize of output 168 [2024-11-14 03:12:30,438 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 212 treesize of output 168 [2024-11-14 03:12:36,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:12:36,204 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 225 treesize of output 81 [2024-11-14 03:12:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 476 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 03:12:44,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:45,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_224) |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2024-11-14 03:12:49,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#float_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_38|)) ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (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) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) |~#float_Array_0~0.offset| |v_skolemized_q#valueAsBitvector_38|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_223) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_224) |c_~#float_Array_0~0.base|) |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-14 03:12:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2000547373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:56,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772573832] [2024-11-14 03:12:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:56,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:56,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:12:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:59,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:12:59,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:06,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:06,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2024-11-14 03:13:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2024-11-14 03:13:10,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:10,244 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 99 treesize of output 51 [2024-11-14 03:13:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-14 03:13:15,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:13:20,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_256) |c_~#unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv1 32))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |c_~#unsigned_char_Array_0~0.offset| (_ bv2 32))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 |c_~#unsigned_char_Array_0~0.offset|)))))))))) is different from false [2024-11-14 03:13:20,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:20,185 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 77 [2024-11-14 03:13:20,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:20,210 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 93 treesize of output 61 [2024-11-14 03:13:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-14 03:13:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772573832] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:13:23,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:23,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 12, 9] total 36 [2024-11-14 03:13:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068034379] [2024-11-14 03:13:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:13:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:13:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:13:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:13:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1242, Unknown=10, NotChecked=300, Total=1722 [2024-11-14 03:13:23,172 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:13:27,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:13:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:13:35,326 INFO L93 Difference]: Finished difference Result 344 states and 488 transitions. [2024-11-14 03:13:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:13:35,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-14 03:13:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:13:35,331 INFO L225 Difference]: With dead ends: 344 [2024-11-14 03:13:35,335 INFO L226 Difference]: Without dead ends: 234 [2024-11-14 03:13:35,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=193, Invalid=1535, Unknown=10, NotChecked=332, Total=2070 [2024-11-14 03:13:35,337 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 215 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:13:35,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 497 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 209 Unchecked, 6.7s Time] [2024-11-14 03:13:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-14 03:13:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2024-11-14 03:13:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 159 states have internal predecessors, (211), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-14 03:13:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2024-11-14 03:13:35,372 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 151 [2024-11-14 03:13:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:13:35,373 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2024-11-14 03:13:35,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-14 03:13:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2024-11-14 03:13:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-14 03:13:35,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:13:35,380 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:35,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:13:35,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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)] Forceful destruction successful, exit code 0 [2024-11-14 03:13:35,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-14 03:13:35,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:13:35,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:13:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:13:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 860339207, now seen corresponding path program 1 times [2024-11-14 03:13:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:13:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136956894] [2024-11-14 03:13:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:13:35,983 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 03:13:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:13:35,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:13:35,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:13:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:13:37,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:13:37,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:13:37,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:37,783 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 56 treesize of output 20 [2024-11-14 03:13:39,800 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 03:13:42,272 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 121 treesize of output 94 [2024-11-14 03:13:43,932 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 121 treesize of output 94 [2024-11-14 03:13:45,692 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 121 treesize of output 94 [2024-11-14 03:13:47,717 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 121 treesize of output 94 [2024-11-14 03:13:49,802 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 121 treesize of output 94 [2024-11-14 03:13:51,016 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 121 treesize of output 94 [2024-11-14 03:13:52,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:13:52,849 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 1 case distinctions, treesize of input 188 treesize of output 97 [2024-11-14 03:13:52,862 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 192 treesize of output 152 [2024-11-14 03:13:58,904 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 192 treesize of output 152 [2024-11-14 03:14:03,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:03,112 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 205 treesize of output 73 [2024-11-14 03:14:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 476 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 03:14:07,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:14:15,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_296 (Array (_ BitVec 32) (_ BitVec 32)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_296) |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2024-11-14 03:14:52,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:14:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136956894] [2024-11-14 03:14:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136956894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1680498218] [2024-11-14 03:14:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:14:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:14:52,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:14:52,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-14 03:14:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:55,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:14:55,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:14:57,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:57,176 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 64 treesize of output 24 [2024-11-14 03:15:00,515 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 03:15:13,934 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 03:15:16,165 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 03:15:20,374 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 03:15:22,989 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 03:15:27,476 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 03:15:29,039 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 03:15:31,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:31,240 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 1 case distinctions, treesize of input 198 treesize of output 101 [2024-11-14 03:15:31,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 133 [2024-11-14 03:15:44,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 133 [2024-11-14 03:15:54,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:54,556 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 170 treesize of output 86 [2024-11-14 03:16:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 476 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 03:16:01,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:01,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_338 (Array (_ BitVec 32) (_ BitVec 32)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_338) |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2024-11-14 03:17:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1680498218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830714284] [2024-11-14 03:17:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:00,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:00,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:00,353 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:00,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:17:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:04,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 03:17:04,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:06,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:06,071 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 64 treesize of output 24 [2024-11-14 03:17:07,800 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 30 treesize of output 1 [2024-11-14 03:17:19,153 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 65 treesize of output 50 [2024-11-14 03:17:20,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 03:17:23,664 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 65 treesize of output 50 [2024-11-14 03:17:25,407 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 65 treesize of output 50 [2024-11-14 03:17:29,225 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 65 treesize of output 50 [2024-11-14 03:17:30,504 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 65 treesize of output 50 [2024-11-14 03:17:31,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:31,844 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 1 case distinctions, treesize of input 132 treesize of output 77 [2024-11-14 03:17:31,853 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 136 treesize of output 108 [2024-11-14 03:17:44,382 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 136 treesize of output 108 [2024-11-14 03:17:57,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:57,531 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 149 treesize of output 53 [2024-11-14 03:18:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 476 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-14 03:18:06,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:07,393 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (select (select (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_381) |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2024-11-14 03:18:11,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#float_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_379 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_58| (_ BitVec 32)) (v_ArrVal_381 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int| |c_~#double_Array_0~0.base|))) (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) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_58|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_58|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_58|)))) (not (fp.lt c_~last_1_double_Array_0_0_~0 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store (select |c_#memory_int| |c_~#float_Array_0~0.base|) |~#float_Array_0~0.offset| |v_skolemized_q#valueAsBitvector_58|)) |c_~#signed_short_int_Array_0~0.base| v_ArrVal_379) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_381) |c_~#float_Array_0~0.base|) |~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) is different from false [2024-11-14 03:18:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830714284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:19,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:18:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2024-11-14 03:18:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577960038] [2024-11-14 03:18:19,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:18:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:18:20,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:18:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1091, Unknown=30, NotChecked=284, Total=1560 [2024-11-14 03:18:20,001 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 11 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 11 states have call predecessors, (53), 11 states have call successors, (53) [2024-11-14 03:21:01,078 WARN L286 SmtUtils]: Spent 29.91s on a formula simplification. DAG size of input: 108 DAG size of output: 139 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:21:04,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:06,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:09,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:12,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:13,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:15,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:17,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:19,817 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 03:21:21,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s 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 03:21:23,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:25,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:28,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:31,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s 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 03:21:34,317 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 03:21:36,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:39,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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 03:21:41,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:43,039 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 03:21:44,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:46,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s 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 03:21:47,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:50,741 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 03:21:52,914 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 03:21:54,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:21:56,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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 03:21:58,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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 03:22:00,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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 03:22:02,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:05,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:07,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:08,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:09,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:12,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse5 (select .cse4 (bvadd (_ bv8 32) |c_~#double_Array_0~0.offset|)))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 42.0 5.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))))) (.cse2 (let ((.cse20 (select (select |c_#memory_int| (_ bv6 32)) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20)))) (.cse6 (let ((.cse19 (concat (select .cse4 (bvadd (_ bv12 32) |c_~#double_Array_0~0.offset|)) .cse5))) (fp ((_ extract 63 63) .cse19) ((_ extract 62 52) .cse19) ((_ extract 51 0) .cse19)))) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))))) (and (exists ((|~#double_Array_0~0.offset| (_ BitVec 32))) (let ((.cse0 (let ((.cse3 (concat (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (fp.leq .cse0 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))))) (= (_ bv5 32) |c_~#double_Array_0~0.base|) (exists ((|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (= .cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|))) (fp.leq .cse6 .cse1) (exists ((v_skolemized_v_prenex_1_17 (_ BitVec 64))) (and (= (let ((.cse7 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_17) ((_ extract 31 0) v_skolemized_v_prenex_1_17)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) c_~last_1_double_Array_0_0_~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_17) ((_ extract 62 52) v_skolemized_v_prenex_1_17) ((_ extract 51 0) v_skolemized_v_prenex_1_17)) .cse8))) (exists ((v_arrayElimCell_48 (_ BitVec 32)) (v_skolemized_v_prenex_1_15 (_ BitVec 64))) (and (= (let ((.cse9 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_15) v_arrayElimCell_48))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) c_~last_1_double_Array_0_0_~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_15) ((_ extract 62 52) v_skolemized_v_prenex_1_15) ((_ extract 51 0) v_skolemized_v_prenex_1_15)) .cse8))) (= (_ bv10 32) |c_~#unsigned_char_Array_0~0.base|) (= (_ bv6 32) |c_~#float_Array_0~0.base|) (exists ((|~#double_Array_0~0.offset| (_ BitVec 32))) (let ((.cse10 (let ((.cse12 (concat (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (and (fp.leq .cse10 .cse1) (fp.geq .cse10 .cse11) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse10))))) (= (_ bv7 32) |c_~#signed_char_Array_0~0.base|) (exists ((v_arrayElimCell_81 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64)) (v_arrayElimCell_80 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_80) ((_ extract 30 23) v_arrayElimCell_80) ((_ extract 22 0) v_arrayElimCell_80))) (.cse14 (let ((.cse15 (concat v_arrayElimCell_81 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|)))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (and (= |c_ULTIMATE.start_step_#t~mem29#1| .cse13) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode .cse14)) (fp.geq .cse14 .cse11) (fp.leq .cse14 .cse1)))) (= |c_~#signed_short_int_Array_0~0.base| (_ bv9 32)) (= |c_~#signed_long_int_Array_0~0.base| (_ bv8 32)) (exists ((|~#double_Array_0~0.offset| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_52| (_ BitVec 64))) (let ((.cse17 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_52|))) (let ((.cse16 (let ((.cse18 (concat (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) .cse17))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18))))) (and (fp.geq .cse16 .cse11) (fp.leq .cse16 .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse16)) (= .cse17 (select .cse4 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))))) (fp.geq .cse6 .cse11) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-14 03:22:15,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:17,860 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 03:22:21,753 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 03:22:24,562 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 03:22:26,778 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 03:22:28,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s 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 03:22:30,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:32,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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 03:22:34,293 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 03:22:45,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:48,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:50,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:22:52,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:02,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:05,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:10,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:36,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:37,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:40,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:23:54,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:02,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:03,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:09,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:11,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:35,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:41,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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 03:24:44,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:48,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:51,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:53,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:24:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:24:56,866 INFO L93 Difference]: Finished difference Result 521 states and 741 transitions. [2024-11-14 03:24:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:24:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 11 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 11 states have call predecessors, (53), 11 states have call successors, (53) Word has length 151 [2024-11-14 03:24:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:24:56,882 INFO L225 Difference]: With dead ends: 521 [2024-11-14 03:24:56,883 INFO L226 Difference]: Without dead ends: 390 [2024-11-14 03:24:56,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 505 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 235.1s TimeCoverageRelationStatistics Valid=203, Invalid=1268, Unknown=31, NotChecked=390, Total=1892 [2024-11-14 03:24:56,885 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 612 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 130 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 339.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 349.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:24:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1980 Invalid, 3080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 2894 Invalid, 25 Unknown, 31 Unchecked, 349.0s Time] [2024-11-14 03:24:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-14 03:24:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 250. [2024-11-14 03:24:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 193 states have (on average 1.3160621761658031) internal successors, (254), 193 states have internal predecessors, (254), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-14 03:24:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 360 transitions. [2024-11-14 03:24:56,939 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 360 transitions. Word has length 151 [2024-11-14 03:24:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:24:56,940 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 360 transitions. [2024-11-14 03:24:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.71875) internal successors, (151), 31 states have internal predecessors, (151), 11 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 11 states have call predecessors, (53), 11 states have call successors, (53) [2024-11-14 03:24:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 360 transitions. [2024-11-14 03:24:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-14 03:24:56,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:24:56,943 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:24:57,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:24:57,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-14 03:24:57,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:24:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:24:57,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:24:57,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:24:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1501895751, now seen corresponding path program 1 times [2024-11-14 03:24:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:24:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307984274] [2024-11-14 03:24:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:57,546 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 03:24:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:24:57,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:24:57,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_300bfa8d-66cc-46c5-b0d4-d5cf67bda9f3/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 03:24:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:58,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:24:58,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:02,426 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 03:25:05,071 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 31 treesize of output 24