./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:41:19,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:41:20,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:41:20,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:41:20,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:41:20,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:41:20,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:41:20,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:41:20,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:41:20,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:41:20,111 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:41:20,113 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:41:20,113 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:41:20,114 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:41:20,115 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:41:20,115 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:41:20,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:41:20,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:41:20,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:41:20,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:41:20,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:41:20,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:41:20,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:41:20,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:20,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:41:20,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:41:20,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:41:20,118 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:41:20,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:41:20,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:41:20,119 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:41:20,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:41:20,119 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2024-11-14 05:41:20,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:41:20,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:41:20,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:41:20,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:41:20,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:41:20,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i Unable to find full path for "g++" [2024-11-14 05:41:22,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:41:22,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:41:22,898 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2024-11-14 05:41:22,908 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/95ec131dd/bfa101ff7acc49489cb0998298747efb/FLAGa09432206 [2024-11-14 05:41:22,927 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/95ec131dd/bfa101ff7acc49489cb0998298747efb [2024-11-14 05:41:22,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:41:22,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:41:22,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:22,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:41:22,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:41:22,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:22" (1/1) ... [2024-11-14 05:41:22,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fb6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:22, skipping insertion in model container [2024-11-14 05:41:22,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:22" (1/1) ... [2024-11-14 05:41:22,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:41:23,165 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2024-11-14 05:41:23,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:23,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:41:23,315 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2024-11-14 05:41:23,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:23,432 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:41:23,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23 WrapperNode [2024-11-14 05:41:23,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:23,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:23,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:41:23,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:41:23,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,550 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-14 05:41:23,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:23,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:41:23,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:41:23,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:41:23,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:41:23,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:41:23,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:41:23,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:41:23,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (1/1) ... [2024-11-14 05:41:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:23,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:41:23,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:41:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:41:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-14 05:41:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:41:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-14 05:41:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:41:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-14 05:41:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:41:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:41:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:41:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:41:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:41:23,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:41:23,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:41:24,680 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-14 05:41:24,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:41:25,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:41:25,537 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:41:25,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:25 BoogieIcfgContainer [2024-11-14 05:41:25,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:41:25,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:41:25,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:41:25,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:41:25,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:41:22" (1/3) ... [2024-11-14 05:41:25,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:25, skipping insertion in model container [2024-11-14 05:41:25,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:23" (2/3) ... [2024-11-14 05:41:25,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:25, skipping insertion in model container [2024-11-14 05:41:25,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:25" (3/3) ... [2024-11-14 05:41:25,550 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2024-11-14 05:41:25,568 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:41:25,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 45 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:41:25,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:41:25,659 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;@1da5eab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:41:25,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:41:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:41:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 05:41:25,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:25,685 INFO L215 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:25,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1504301270, now seen corresponding path program 1 times [2024-11-14 05:41:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:41:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253026953] [2024-11-14 05:41:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:41:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:41:29,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:41:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:41:31,466 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:41:31,468 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:41:31,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 05:41:31,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:41:31,476 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 05:41:31,535 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:41:31,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:41:31 BoogieIcfgContainer [2024-11-14 05:41:31,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:41:31,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:41:31,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:41:31,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:41:31,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:25" (3/4) ... [2024-11-14 05:41:31,543 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 05:41:31,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:41:31,545 INFO L158 Benchmark]: Toolchain (without parser) took 8613.63ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 91.5MB in the beginning and 99.2MB in the end (delta: -7.7MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,546 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:41:31,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.60ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.74ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:41:31,547 INFO L158 Benchmark]: Boogie Preprocessor took 97.74ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 69.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,548 INFO L158 Benchmark]: RCFGBuilder took 1888.98ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 59.7MB in the end (delta: 9.4MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,548 INFO L158 Benchmark]: TraceAbstraction took 5998.50ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 59.7MB in the beginning and 101.7MB in the end (delta: -42.0MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,549 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 276.8MB. Free memory was 101.7MB in the beginning and 99.2MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:41:31,551 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.60ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.74ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 97.74ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 69.1MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1888.98ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 59.7MB in the end (delta: 9.4MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5998.50ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 59.7MB in the beginning and 101.7MB in the end (delta: -42.0MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 276.8MB. Free memory was 101.7MB in the beginning and 99.2MB in the end (delta: 2.5MB). 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 someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] RET updateVariables() [L105] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1][0] [L37] BOOL_unsigned_char_Array_0[1][2] = BOOL_unsigned_char_Array_0[1][0] [L38] EXPR unsigned_long_int_Array_0[1] [L38] EXPR unsigned_long_int_Array_0[0] [L38] EXPR unsigned_long_int_Array_0[2] [L38] COND TRUE unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2]) [L39] EXPR unsigned_short_int_Array_0[1] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L39] EXPR unsigned_short_int_Array_0[1] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L39] unsigned_short_int_Array_0[0] = ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))) [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] [L41] COND FALSE !((double_Array_0[0] * 16.5f) > double_Array_0[1]) [L44] EXPR BOOL_unsigned_char_Array_0[0][1] [L44] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] [L44] EXPR BOOL_unsigned_char_Array_0[1][1] [L44] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] [L44] BOOL_unsigned_char_Array_0[0][2] = (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]) [L46] EXPR unsigned_short_int_Array_0[0] [L46] EXPR unsigned_long_int_Array_0[3] [L46] EXPR unsigned_long_int_Array_0[2] [L46] EXPR unsigned_short_int_Array_0[0] [L46] unsigned_long_int_Array_0[4] = (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L47] signed long int stepLocal_1 = (((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0])); [L48] EXPR unsigned_long_int_Array_0[3] [L48] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[3]; [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR unsigned_long_int_Array_0[3] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L49] COND TRUE stepLocal_1 != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]))) [L50] EXPR double_Array_0[0] [L50] EXPR double_Array_0[1] [L50] COND TRUE double_Array_0[0] == double_Array_0[1] [L51] BOOL_unsigned_char_Array_0[1][2] [L51] COND FALSE !(BOOL_unsigned_char_Array_0[1][2]) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR unsigned_long_int_Array_0[4] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[3] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L96] EXPR BOOL_unsigned_char_Array_0[1][2] [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_long_int_Array_0[3] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L96] EXPR BOOL_unsigned_char_Array_0[1][2] [L96] EXPR BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1 [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) [L96] EXPR unsigned_long_int_Array_0[1] [L96] EXPR unsigned_long_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[1] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L96] EXPR unsigned_short_int_Array_0[1] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) [L96] EXPR BOOL_unsigned_char_Array_0[0][2] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) [L96-L97] return ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 1, TraceHistogramMax: 18, 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=45occurred 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.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 05:41:31,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:41:34,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:41:34,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 05:41:34,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:41:34,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:41:34,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:41:34,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:41:34,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:41:34,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:41:34,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:41:34,993 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:41:34,993 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:41:34,993 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:41:34,993 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:41:34,994 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:41:34,994 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:41:34,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:41:34,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:41:34,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:41:34,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:41:34,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:41:34,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:41:34,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:41:34,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:41:34,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:41:34,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:34,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:41:34,998 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:41:34,998 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2024-11-14 05:41:35,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:41:35,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:41:35,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:41:35,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:41:35,370 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:41:35,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i Unable to find full path for "g++" [2024-11-14 05:41:37,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:41:37,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:41:37,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2024-11-14 05:41:37,947 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/558306f71/a11d7b96947f49449f1c9ca581d45f7c/FLAGaa89e73dc [2024-11-14 05:41:37,974 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/data/558306f71/a11d7b96947f49449f1c9ca581d45f7c [2024-11-14 05:41:37,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:41:37,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:41:37,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:37,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:41:37,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:41:37,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:37" (1/1) ... [2024-11-14 05:41:37,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2536d867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:37, skipping insertion in model container [2024-11-14 05:41:37,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:41:37" (1/1) ... [2024-11-14 05:41:38,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:41:38,200 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2024-11-14 05:41:38,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:38,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:41:38,361 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_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2024-11-14 05:41:38,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:41:38,476 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:41:38,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38 WrapperNode [2024-11-14 05:41:38,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:41:38,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:38,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:41:38,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:41:38,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,571 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-14 05:41:38,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:41:38,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:41:38,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:41:38,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:41:38,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:41:38,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:41:38,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:41:38,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:41:38,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (1/1) ... [2024-11-14 05:41:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:41:38,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:38,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:41:38,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:41:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:41:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-14 05:41:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-14 05:41:38,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:41:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-14 05:41:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:41:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 05:41:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-14 05:41:38,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 05:41:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:41:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-14 05:41:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:41:38,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:41:38,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:41:40,315 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-14 05:41:40,315 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:41:40,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:41:40,333 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:41:40,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:40 BoogieIcfgContainer [2024-11-14 05:41:40,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:41:40,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:41:40,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:41:40,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:41:40,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:41:37" (1/3) ... [2024-11-14 05:41:40,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b23e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:40, skipping insertion in model container [2024-11-14 05:41:40,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:41:38" (2/3) ... [2024-11-14 05:41:40,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b23e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:41:40, skipping insertion in model container [2024-11-14 05:41:40,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:41:40" (3/3) ... [2024-11-14 05:41:40,348 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2024-11-14 05:41:40,362 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:41:40,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 05:41:40,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:41:40,449 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;@620f586d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:41:40,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:41:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:41:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-14 05:41:40,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:40,476 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:40,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:40,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -445876963, now seen corresponding path program 1 times [2024-11-14 05:41:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:41:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84253268] [2024-11-14 05:41:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:41:40,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:41:40,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 05:41:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:41,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:41:41,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-14 05:41:41,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:41:41,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:41:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84253268] [2024-11-14 05:41:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84253268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:41:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458199617] [2024-11-14 05:41:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:41:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:41:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:41:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:41:41,208 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-14 05:41:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:41,244 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2024-11-14 05:41:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:41:41,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2024-11-14 05:41:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:41,255 INFO L225 Difference]: With dead ends: 217 [2024-11-14 05:41:41,255 INFO L226 Difference]: Without dead ends: 108 [2024-11-14 05:41:41,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:41:41,262 INFO L432 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:41,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:41:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-14 05:41:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-14 05:41:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:41:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2024-11-14 05:41:41,316 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2024-11-14 05:41:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:41,317 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2024-11-14 05:41:41,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-14 05:41:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2024-11-14 05:41:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-14 05:41:41,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:41,325 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:41,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-14 05:41:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:41,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 135764093, now seen corresponding path program 1 times [2024-11-14 05:41:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:41:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761047184] [2024-11-14 05:41:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:41:41,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:41:41,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 05:41:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:42,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:41:42,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:41:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:41:42,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:41:42,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:41:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761047184] [2024-11-14 05:41:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761047184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:41:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:41:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572972385] [2024-11-14 05:41:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:42,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:41:42,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:41:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:41:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:41:42,189 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:41:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:41:42,269 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2024-11-14 05:41:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:41:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-14 05:41:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:41:42,273 INFO L225 Difference]: With dead ends: 213 [2024-11-14 05:41:42,273 INFO L226 Difference]: Without dead ends: 108 [2024-11-14 05:41:42,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:41:42,275 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:41:42,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:41:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-14 05:41:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-14 05:41:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:41:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-14 05:41:42,299 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2024-11-14 05:41:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:41:42,301 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-14 05:41:42,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:41:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-14 05:41:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-14 05:41:42,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:41:42,305 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:41:42,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-14 05:41:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:42,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:41:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:41:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -885304261, now seen corresponding path program 1 times [2024-11-14 05:41:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:41:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888062174] [2024-11-14 05:41:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:42,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:41:42,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:41:42,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:41:42,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 05:41:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:43,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-14 05:41:43,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:44,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:41:45,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:41:45,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:41:46,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:41:46,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:41:46,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:41:46,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:41:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 140 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-14 05:41:46,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:46,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem25#1_7| (_ BitVec 16)) (v_ArrVal_95 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_95) |c_~#unsigned_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#unsigned_long_int_Array_0~0.offset|)) ((_ zero_extend 16) |v_ULTIMATE.start_step_#t~mem25#1_7|)))) is different from false [2024-11-14 05:41:47,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:41:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888062174] [2024-11-14 05:41:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888062174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2074891615] [2024-11-14 05:41:47,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:41:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:41:47,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:41:47,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-14 05:41:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:48,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:41:48,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:50,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:41:51,637 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 30 treesize of output 14 [2024-11-14 05:41:51,997 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 23 treesize of output 16 [2024-11-14 05:41:52,369 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 23 treesize of output 16 [2024-11-14 05:41:52,457 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 23 treesize of output 16 [2024-11-14 05:41:52,495 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 30 treesize of output 14 [2024-11-14 05:41:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 140 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-14 05:41:52,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:41:53,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_step_#t~mem25#1_7| (_ BitVec 16)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ zero_extend 16) |v_ULTIMATE.start_step_#t~mem25#1_7|) (select (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_133) |c_~#unsigned_long_int_Array_0~0.base|) (bvadd (_ bv8 32) |c_~#unsigned_long_int_Array_0~0.offset|))))) is different from false [2024-11-14 05:41:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2074891615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:41:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101138186] [2024-11-14 05:41:53,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:41:53,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:41:53,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:41:53,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:41:53,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:41:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:41:53,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:41:53,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:41:54,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-14 05:41:54,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2024-11-14 05:41:54,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:41:54,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:41:54,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 98 [2024-11-14 05:41:54,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2024-11-14 05:41:55,117 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 87 treesize of output 68 [2024-11-14 05:41:55,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:41:55,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 76 [2024-11-14 05:41:55,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:41:55,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 139 treesize of output 57 [2024-11-14 05:41:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:41:55,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:41:55,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101138186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:41:55,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:41:55,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 14] total 35 [2024-11-14 05:41:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145409271] [2024-11-14 05:41:55,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:41:55,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:41:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:41:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:41:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1365, Unknown=2, NotChecked=154, Total=1722 [2024-11-14 05:41:55,975 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:42:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:01,247 INFO L93 Difference]: Finished difference Result 354 states and 505 transitions. [2024-11-14 05:42:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:42:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-11-14 05:42:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:01,253 INFO L225 Difference]: With dead ends: 354 [2024-11-14 05:42:01,257 INFO L226 Difference]: Without dead ends: 249 [2024-11-14 05:42:01,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=256, Invalid=1912, Unknown=2, NotChecked=182, Total=2352 [2024-11-14 05:42:01,261 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 320 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:01,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 471 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-14 05:42:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-14 05:42:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 126. [2024-11-14 05:42:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:42:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 181 transitions. [2024-11-14 05:42:01,281 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 181 transitions. Word has length 140 [2024-11-14 05:42:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 181 transitions. [2024-11-14 05:42:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:42:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 181 transitions. [2024-11-14 05:42:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-14 05:42:01,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:01,286 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:01,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 05:42:01,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:42:01,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:42:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:01,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:42:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -184239683, now seen corresponding path program 1 times [2024-11-14 05:42:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:42:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466100759] [2024-11-14 05:42:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:01,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:42:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:42:01,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:42:01,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 05:42:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:02,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:42:02,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:03,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:42:04,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:42:04,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:42:04,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:42:04,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:04,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 52 [2024-11-14 05:42:05,223 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 97 treesize of output 77 [2024-11-14 05:42:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-14 05:42:05,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:09,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_204))) (let ((.cse4 (bvadd (_ bv8 32) |c_~#unsigned_long_int_Array_0~0.offset|)) (.cse10 (select .cse1 |c_~#unsigned_long_int_Array_0~0.base|)) (.cse6 (bvadd (_ bv12 32) |c_~#unsigned_long_int_Array_0~0.offset|))) (let ((.cse8 (bvadd (_ bv16 32) |c_~#unsigned_long_int_Array_0~0.offset|)) (.cse9 (select .cse10 .cse6)) (.cse0 (select .cse10 .cse4))) (let ((.cse2 (store .cse10 .cse8 (let ((.cse11 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd .cse9 (bvneg (bvadd .cse0 (bvneg .cse11))) .cse11))))) (or (not (= .cse0 ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse1 |c_~#unsigned_long_int_Array_0~0.base| .cse2) |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse7 (store (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| .cse2) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_207))) (let ((.cse3 (select .cse7 |c_~#unsigned_long_int_Array_0~0.base|))) (= (let ((.cse5 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse7 |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))))) (bvadd (bvneg (bvadd (select .cse3 .cse4) (bvneg .cse5))) (select .cse3 .cse6) .cse5)) (select .cse3 .cse8)))) (not (bvult .cse0 .cse9)))))))) is different from false [2024-11-14 05:42:11,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:42:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466100759] [2024-11-14 05:42:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466100759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [404397123] [2024-11-14 05:42:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:42:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:42:11,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:42:11,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-14 05:42:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:12,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 05:42:12,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:28,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:42:39,468 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 30 treesize of output 14 [2024-11-14 05:42:43,031 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 23 treesize of output 16 [2024-11-14 05:42:46,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 23 treesize of output 16 [2024-11-14 05:42:47,693 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 23 treesize of output 16 [2024-11-14 05:42:48,008 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 30 treesize of output 14 [2024-11-14 05:42:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 140 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-14 05:42:52,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [404397123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:59,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60153074] [2024-11-14 05:42:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:59,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:59,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:59,473 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:59,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:43:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:00,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:43:00,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:20,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:43:23,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:43:27,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:43:27,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:43:29,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:43:32,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:43:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 188 proven. 140 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-14 05:43:33,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60153074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:37,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2024-11-14 05:43:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448538509] [2024-11-14 05:43:37,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:37,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-14 05:43:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:43:37,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-14 05:43:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2300, Unknown=34, NotChecked=100, Total=2756 [2024-11-14 05:43:37,222 INFO L87 Difference]: Start difference. First operand 126 states and 181 transitions. Second operand has 41 states, 35 states have (on average 4.057142857142857) internal successors, (142), 37 states have internal predecessors, (142), 13 states have call successors, (42), 10 states have call predecessors, (42), 12 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) [2024-11-14 05:45:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:45:29,519 INFO L93 Difference]: Finished difference Result 291 states and 404 transitions. [2024-11-14 05:45:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 05:45:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 4.057142857142857) internal successors, (142), 37 states have internal predecessors, (142), 13 states have call successors, (42), 10 states have call predecessors, (42), 12 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) Word has length 140 [2024-11-14 05:45:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:45:29,527 INFO L225 Difference]: With dead ends: 291 [2024-11-14 05:45:29,527 INFO L226 Difference]: Without dead ends: 168 [2024-11-14 05:45:29,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=923, Invalid=4886, Unknown=47, NotChecked=150, Total=6006 [2024-11-14 05:45:29,536 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 533 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:45:29,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1242 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 83.6s Time] [2024-11-14 05:45:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-14 05:45:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2024-11-14 05:45:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 128 states have (on average 1.2734375) internal successors, (163), 129 states have internal predecessors, (163), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:45:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2024-11-14 05:45:29,593 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 140 [2024-11-14 05:45:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:45:29,594 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2024-11-14 05:45:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 4.057142857142857) internal successors, (142), 37 states have internal predecessors, (142), 13 states have call successors, (42), 10 states have call predecessors, (42), 12 states have return successors, (42), 10 states have call predecessors, (42), 13 states have call successors, (42) [2024-11-14 05:45:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2024-11-14 05:45:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-14 05:45:29,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:45:29,597 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:45:29,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-14 05:45:29,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-14 05:45:30,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 05:45:30,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:45:30,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:45:30,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:45:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash 481880261, now seen corresponding path program 1 times [2024-11-14 05:45:30,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:45:30,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564114309] [2024-11-14 05:45:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:45:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:45:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:45:30,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:45:30,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 05:45:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:45:30,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:45:30,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:45:31,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-14 05:45:37,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-14 05:45:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-14 05:45:44,063 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 30 treesize of output 23 [2024-11-14 05:45:46,752 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 30 treesize of output 23 [2024-11-14 05:45:49,186 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 30 treesize of output 23 [2024-11-14 05:45:52,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-14 05:45:55,488 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 30 treesize of output 23 [2024-11-14 05:45:58,613 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 30 treesize of output 23 [2024-11-14 05:46:01,601 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 30 treesize of output 23 [2024-11-14 05:46:04,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-11-14 05:46:06,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2024-11-14 05:46:07,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2024-11-14 05:46:07,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:07,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:07,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 107 [2024-11-14 05:46:07,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:46:08,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 49 [2024-11-14 05:46:09,742 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 129 treesize of output 102 [2024-11-14 05:46:14,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:14,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 70 [2024-11-14 05:46:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 28 proven. 323 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-14 05:46:15,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:16,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))))) is different from false [2024-11-14 05:46:18,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse1 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326))) (let ((.cse4 (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse5 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))) (= (_ bv0 8) ((_ extract 7 0) (select .cse4 .cse6))))))) (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326))) (let ((.cse9 (select .cse8 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store .cse8 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse9 .cse5 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1)))))) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse9 .cse6)))))))))) is different from false [2024-11-14 05:46:19,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse2 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (let ((.cse4 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (let ((.cse9 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (store .cse9 .cse1 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 .cse2)))))))) (and (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse3 .cse4 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse3 .cse5))))))) (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_326) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse8 .cse4 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse2)))))) (= (_ bv0 8) ((_ extract 7 0) (select .cse8 .cse5))))))))) is different from false [2024-11-14 05:46:20,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:46:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564114309] [2024-11-14 05:46:20,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564114309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:46:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [786157505] [2024-11-14 05:46:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:20,537 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:46:20,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:46:20,539 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:46:20,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-14 05:46:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:22,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 05:46:22,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:46:23,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:46:30,275 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 22 treesize of output 21 [2024-11-14 05:46:35,287 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 33 treesize of output 24 [2024-11-14 05:46:39,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:46:42,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:46:45,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:46:49,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 26 treesize of output 19 [2024-11-14 05:46:52,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:46:55,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:46:59,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 05:47:03,016 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 35 treesize of output 33 [2024-11-14 05:47:05,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2024-11-14 05:47:06,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2024-11-14 05:47:06,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:47:06,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2024-11-14 05:47:07,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2024-11-14 05:47:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 78 [2024-11-14 05:47:15,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 70 [2024-11-14 05:47:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 28 proven. 323 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-14 05:47:15,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:47:15,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_374) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))))) is different from false [2024-11-14 05:47:17,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse4 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse3 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_372 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372))) (let ((.cse0 (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse0 .cse1)))) (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store .cse5 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse0 .cse6 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse3))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse4)))))))))) (forall ((v_ArrVal_372 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372))) (let ((.cse7 (select .cse9 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse7 .cse1))) (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store .cse9 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse7 .cse6 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse3)))))))))))) is different from false [2024-11-14 05:47:18,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse4 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (let ((.cse9 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (store .cse9 .cse3 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 .cse4)))))))) (and (forall ((v_ArrVal_372 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse0 .cse1))) (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse0 .cse5 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse3))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse4))))))))) (forall ((v_ArrVal_372 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse7 .cse1)))) (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_372) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse7 .cse5 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse3)))))))))))) is different from false [2024-11-14 05:47:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [786157505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:47:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845262697] [2024-11-14 05:47:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:47:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:47:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:47:19,543 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:47:19,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:47:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:47:20,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 05:47:20,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:47:24,513 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 22 treesize of output 21 [2024-11-14 05:47:29,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-14 05:47:35,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 05:47:39,117 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 34 treesize of output 25 [2024-11-14 05:47:43,222 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 34 treesize of output 25 [2024-11-14 05:47:47,110 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 34 treesize of output 25 [2024-11-14 05:47:51,154 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 34 treesize of output 25 [2024-11-14 05:47:55,864 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 34 treesize of output 25 [2024-11-14 05:48:00,117 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 34 treesize of output 25 [2024-11-14 05:48:04,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2024-11-14 05:48:06,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-14 05:48:08,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 63 [2024-11-14 05:48:08,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:48:08,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2024-11-14 05:48:09,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2024-11-14 05:48:12,043 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 115 treesize of output 88 [2024-11-14 05:48:18,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 80 [2024-11-14 05:48:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 52 proven. 323 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-14 05:48:18,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:48:22,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse1 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415))) (let ((.cse4 (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse5 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))) (= (_ bv0 8) ((_ extract 7 0) (select .cse4 .cse6))))))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415))) (let ((.cse9 (select .cse8 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store .cse8 |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse9 .cse5 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1)))))) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse9 .cse6)))))))))) is different from false [2024-11-14 05:48:23,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv5 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse1 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse4 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (let ((.cse9 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (store .cse9 .cse2 ((_ sign_extend 24) ((_ extract 7 0) (select .cse9 .cse1)))))))) (and (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse3 .cse4 ((_ sign_extend 24) (_ bv1 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2)))))) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse3 .cse5))))))) (forall ((v_ArrVal_415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse7 .cse5))) (forall ((v_ArrVal_328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_415) |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse7 .cse4 ((_ sign_extend 24) (_ bv0 8)))) |c_~#unsigned_long_int_Array_0~0.base| v_ArrVal_328) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse1)))))))))))) is different from false [2024-11-14 05:48:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845262697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:48:24,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:48:24,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 31 [2024-11-14 05:48:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611526247] [2024-11-14 05:48:24,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:48:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 05:48:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:48:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 05:48:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1028, Unknown=29, NotChecked=584, Total=1806 [2024-11-14 05:48:24,202 INFO L87 Difference]: Start difference. First operand 159 states and 211 transitions. Second operand has 32 states, 30 states have (on average 5.366666666666666) internal successors, (161), 30 states have internal predecessors, (161), 10 states have call successors, (50), 8 states have call predecessors, (50), 10 states have return successors, (50), 9 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-14 05:49:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:30,575 INFO L93 Difference]: Finished difference Result 387 states and 504 transitions. [2024-11-14 05:49:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 05:49:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 5.366666666666666) internal successors, (161), 30 states have internal predecessors, (161), 10 states have call successors, (50), 8 states have call predecessors, (50), 10 states have return successors, (50), 9 states have call predecessors, (50), 10 states have call successors, (50) Word has length 143 [2024-11-14 05:49:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:30,580 INFO L225 Difference]: With dead ends: 387 [2024-11-14 05:49:30,580 INFO L226 Difference]: Without dead ends: 244 [2024-11-14 05:49:30,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 460 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=512, Invalid=2348, Unknown=34, NotChecked=888, Total=3782 [2024-11-14 05:49:30,582 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1312 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:30,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 710 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 48.2s Time] [2024-11-14 05:49:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-14 05:49:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 157. [2024-11-14 05:49:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:49:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-11-14 05:49:30,638 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 143 [2024-11-14 05:49:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:30,638 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-11-14 05:49:30,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 5.366666666666666) internal successors, (161), 30 states have internal predecessors, (161), 10 states have call successors, (50), 8 states have call predecessors, (50), 10 states have return successors, (50), 9 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-14 05:49:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-11-14 05:49:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-14 05:49:30,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:30,642 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:30,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-14 05:49:30,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 05:49:31,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:49:31,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:31,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:49:31,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1352756633, now seen corresponding path program 1 times [2024-11-14 05:49:31,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:49:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184395952] [2024-11-14 05:49:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:31,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:49:31,249 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:49:31,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 05:49:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:31,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:49:31,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:33,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:33,592 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 35 treesize of output 29 [2024-11-14 05:49:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:49:34,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:49:34,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:49:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184395952] [2024-11-14 05:49:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184395952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:49:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:49:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:49:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388448256] [2024-11-14 05:49:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:49:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:49:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:49:34,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:49:34,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:49:34,116 INFO L87 Difference]: Start difference. First operand 157 states and 197 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:49:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:47,846 INFO L93 Difference]: Finished difference Result 334 states and 427 transitions. [2024-11-14 05:49:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:49:47,847 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-14 05:49:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:47,849 INFO L225 Difference]: With dead ends: 334 [2024-11-14 05:49:47,849 INFO L226 Difference]: Without dead ends: 201 [2024-11-14 05:49:47,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:49:47,851 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:47,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 645 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2024-11-14 05:49:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-14 05:49:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2024-11-14 05:49:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 134 states have internal predecessors, (164), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:49:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2024-11-14 05:49:47,885 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 146 [2024-11-14 05:49:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2024-11-14 05:49:47,886 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:49:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2024-11-14 05:49:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-14 05:49:47,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:47,889 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:47,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 05:49:48,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:48,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:49:48,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2053821211, now seen corresponding path program 1 times [2024-11-14 05:49:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:49:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415092684] [2024-11-14 05:49:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:48,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:48,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:49:48,093 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:49:48,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 05:49:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:48,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:49:48,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:48,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-14 05:49:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:49:48,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:49:48,989 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:49:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415092684] [2024-11-14 05:49:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415092684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:49:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:49:48,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:49:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479767894] [2024-11-14 05:49:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:49:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:49:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:49:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:49:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:49:48,991 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:49:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:49,247 INFO L93 Difference]: Finished difference Result 312 states and 396 transitions. [2024-11-14 05:49:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:49:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-14 05:49:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:49,250 INFO L225 Difference]: With dead ends: 312 [2024-11-14 05:49:49,251 INFO L226 Difference]: Without dead ends: 168 [2024-11-14 05:49:49,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:49:49,252 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:49,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:49:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-14 05:49:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-14 05:49:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.218045112781955) internal successors, (162), 134 states have internal predecessors, (162), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:49:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2024-11-14 05:49:49,293 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 146 [2024-11-14 05:49:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:49,294 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2024-11-14 05:49:49,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:49:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2024-11-14 05:49:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-14 05:49:49,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:49,298 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:49:49,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-14 05:49:49,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:49,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:49:49,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1467015197, now seen corresponding path program 1 times [2024-11-14 05:49:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:49:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204309927] [2024-11-14 05:49:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:49:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:49:49,503 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:49:49,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-14 05:49:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:50,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:49:50,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:49:51,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:49:51,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:49:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204309927] [2024-11-14 05:49:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204309927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:49:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:49:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:49:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805112731] [2024-11-14 05:49:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:49:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:49:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:49:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:49:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:49:51,818 INFO L87 Difference]: Start difference. First operand 168 states and 210 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:50:02,214 INFO L93 Difference]: Finished difference Result 344 states and 435 transitions. [2024-11-14 05:50:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:50:02,217 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-14 05:50:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:50:02,220 INFO L225 Difference]: With dead ends: 344 [2024-11-14 05:50:02,220 INFO L226 Difference]: Without dead ends: 200 [2024-11-14 05:50:02,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:50:02,221 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:50:02,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 422 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-14 05:50:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-14 05:50:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 168. [2024-11-14 05:50:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 134 states have internal predecessors, (161), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:50:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2024-11-14 05:50:02,256 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 146 [2024-11-14 05:50:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:50:02,257 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2024-11-14 05:50:02,257 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2024-11-14 05:50:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-14 05:50:02,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:50:02,259 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:50:02,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-14 05:50:02,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:02,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:50:02,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:50:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash -51697831, now seen corresponding path program 1 times [2024-11-14 05:50:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:50:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428756456] [2024-11-14 05:50:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:50:02,466 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:50:02,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-14 05:50:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:03,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:50:03,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:50:04,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:50:04,663 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:50:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428756456] [2024-11-14 05:50:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428756456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:50:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:50:04,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:50:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799600139] [2024-11-14 05:50:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:50:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:50:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:50:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:50:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:50:04,665 INFO L87 Difference]: Start difference. First operand 168 states and 209 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:50:15,272 INFO L93 Difference]: Finished difference Result 352 states and 443 transitions. [2024-11-14 05:50:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:50:15,273 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-14 05:50:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:50:15,275 INFO L225 Difference]: With dead ends: 352 [2024-11-14 05:50:15,275 INFO L226 Difference]: Without dead ends: 208 [2024-11-14 05:50:15,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:50:15,277 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 47 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:50:15,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 449 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-14 05:50:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-14 05:50:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2024-11-14 05:50:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.2) internal successors, (168), 141 states have internal predecessors, (168), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:50:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2024-11-14 05:50:15,307 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 146 [2024-11-14 05:50:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:50:15,307 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2024-11-14 05:50:15,307 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2024-11-14 05:50:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-14 05:50:15,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:50:15,308 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:50:15,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 05:50:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:15,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:50:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:50:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 649366747, now seen corresponding path program 1 times [2024-11-14 05:50:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:50:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849312705] [2024-11-14 05:50:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:50:15,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:50:15,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 05:50:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:15,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:50:15,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:17,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:50:17,860 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 35 treesize of output 29 [2024-11-14 05:50:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:50:18,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:50:18,316 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:50:18,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849312705] [2024-11-14 05:50:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849312705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:50:18,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:50:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:50:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835008131] [2024-11-14 05:50:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:50:18,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:50:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:50:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:50:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:50:18,318 INFO L87 Difference]: Start difference. First operand 175 states and 216 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:50:33,555 INFO L93 Difference]: Finished difference Result 359 states and 449 transitions. [2024-11-14 05:50:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:50:33,556 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-14 05:50:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:50:33,558 INFO L225 Difference]: With dead ends: 359 [2024-11-14 05:50:33,558 INFO L226 Difference]: Without dead ends: 208 [2024-11-14 05:50:33,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:50:33,559 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:50:33,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 856 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-11-14 05:50:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-14 05:50:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2024-11-14 05:50:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.2) internal successors, (168), 141 states have internal predecessors, (168), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-14 05:50:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2024-11-14 05:50:33,593 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 146 [2024-11-14 05:50:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:50:33,593 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2024-11-14 05:50:33,593 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:50:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2024-11-14 05:50:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-14 05:50:33,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:50:33,595 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:50:33,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 05:50:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:33,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:50:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:50:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -793170428, now seen corresponding path program 1 times [2024-11-14 05:50:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:50:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232735273] [2024-11-14 05:50:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:50:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:50:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:50:33,798 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:50:33,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 05:50:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:50:34,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:50:34,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:50:48,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:50:54,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:50:57,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:50:57,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:50:58,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:50:59,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:51:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 128 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-14 05:51:00,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:02,524 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:51:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232735273] [2024-11-14 05:51:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232735273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1558605845] [2024-11-14 05:51:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:51:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:51:02,527 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:51:02,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-14 05:51:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:03,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:51:03,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:18,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:51:20,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:51:20,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:51:21,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:51:25,673 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 25 treesize of output 23 [2024-11-14 05:51:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 05:51:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:51:28,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:51:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1558605845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:51:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:51:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-14 05:51:28,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715044776] [2024-11-14 05:51:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:51:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:51:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:51:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:51:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=459, Unknown=11, NotChecked=0, Total=552 [2024-11-14 05:51:28,910 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:51:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:52,405 INFO L93 Difference]: Finished difference Result 396 states and 490 transitions. [2024-11-14 05:51:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:51:52,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-14 05:51:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:52,409 INFO L225 Difference]: With dead ends: 396 [2024-11-14 05:51:52,409 INFO L226 Difference]: Without dead ends: 245 [2024-11-14 05:51:52,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=96, Invalid=543, Unknown=11, NotChecked=0, Total=650 [2024-11-14 05:51:52,411 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 149 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:52,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 458 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 733 Invalid, 3 Unknown, 0 Unchecked, 21.9s Time] [2024-11-14 05:51:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-14 05:51:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 164. [2024-11-14 05:51:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 137 states have internal predecessors, (168), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:51:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2024-11-14 05:51:52,486 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 148 [2024-11-14 05:51:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:52,486 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2024-11-14 05:51:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:51:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2024-11-14 05:51:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-14 05:51:52,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:52,491 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:51:52,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-14 05:51:52,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 05:51:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:52,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:51:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash -92105850, now seen corresponding path program 1 times [2024-11-14 05:51:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:51:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041702461] [2024-11-14 05:51:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:52,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:51:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:51:52,905 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:51:52,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 (20)] Waiting until timeout for monitored process [2024-11-14 05:51:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:53,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:51:53,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:08,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:52:15,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:52:18,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:52:19,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:52:20,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:52:20,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:52:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 128 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-14 05:52:21,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:52:25,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:52:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041702461] [2024-11-14 05:52:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041702461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:52:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1297243886] [2024-11-14 05:52:25,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:52:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:52:25,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:52:25,043 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:52:25,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 05:52:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:52:26,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:52:26,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:52:41,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:52:44,395 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 24 treesize of output 17 [2024-11-14 05:52:45,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:52:45,947 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 34 treesize of output 10 [2024-11-14 05:52:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:52:46,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:52:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1297243886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:52:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:52:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2024-11-14 05:52:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761800933] [2024-11-14 05:52:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:52:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:52:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:52:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:52:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=365, Unknown=12, NotChecked=0, Total=462 [2024-11-14 05:52:46,754 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:53:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:53:02,775 INFO L93 Difference]: Finished difference Result 379 states and 471 transitions. [2024-11-14 05:53:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:53:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-14 05:53:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:53:02,778 INFO L225 Difference]: With dead ends: 379 [2024-11-14 05:53:02,778 INFO L226 Difference]: Without dead ends: 218 [2024-11-14 05:53:02,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=91, Invalid=403, Unknown=12, NotChecked=0, Total=506 [2024-11-14 05:53:02,780 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:53:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 331 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-14 05:53:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-14 05:53:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 157. [2024-11-14 05:53:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 130 states have internal predecessors, (160), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:53:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2024-11-14 05:53:02,814 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 148 [2024-11-14 05:53:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:53:02,815 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2024-11-14 05:53:02,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:53:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2024-11-14 05:53:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-14 05:53:02,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:53:02,816 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:53:02,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-14 05:53:03,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/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 (20)] Forceful destruction successful, exit code 0 [2024-11-14 05:53:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:53:03,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:53:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:53:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 145246487, now seen corresponding path program 1 times [2024-11-14 05:53:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:53:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261272186] [2024-11-14 05:53:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:03,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:53:03,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:53:03,221 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:53:03,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-14 05:53:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:03,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:53:03,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:53:04,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:53:04,489 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:53:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261272186] [2024-11-14 05:53:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261272186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:53:04,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:53:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:53:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776786347] [2024-11-14 05:53:04,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:53:04,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:53:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:53:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:53:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:53:04,491 INFO L87 Difference]: Start difference. First operand 157 states and 196 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:53:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:53:05,432 INFO L93 Difference]: Finished difference Result 315 states and 394 transitions. [2024-11-14 05:53:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:53:05,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-14 05:53:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:53:05,434 INFO L225 Difference]: With dead ends: 315 [2024-11-14 05:53:05,434 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 05:53:05,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:53:05,436 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:53:05,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:53:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 05:53:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-14 05:53:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.2238805970149254) internal successors, (164), 134 states have internal predecessors, (164), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:53:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2024-11-14 05:53:05,469 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 148 [2024-11-14 05:53:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:53:05,469 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2024-11-14 05:53:05,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:53:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2024-11-14 05:53:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-14 05:53:05,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:53:05,471 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:53:05,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-14 05:53:05,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:53:05,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:53:05,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:53:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash -574315710, now seen corresponding path program 1 times [2024-11-14 05:53:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:53:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867721556] [2024-11-14 05:53:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:05,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:53:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:53:05,678 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:53:05,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 05:53:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:06,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:53:06,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:19,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:53:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:53:29,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:53:29,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:53:30,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:53:30,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:53:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 128 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-14 05:53:31,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:53:33,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem36#1| (_ BitVec 16))) (bvuge (select (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_761) |c_~#unsigned_long_int_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#unsigned_long_int_Array_0~0.offset|)) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem36#1|))) is different from false [2024-11-14 05:53:33,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:53:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867721556] [2024-11-14 05:53:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867721556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1400986271] [2024-11-14 05:53:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:53:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:53:33,486 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:53:33,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-14 05:53:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:34,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:53:34,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:46,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:53:49,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-14 05:53:50,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:53:50,259 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 35 treesize of output 11 [2024-11-14 05:53:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:53:50,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:53:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1400986271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:53:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:53:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2024-11-14 05:53:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280633340] [2024-11-14 05:53:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:53:50,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:53:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:53:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:53:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2024-11-14 05:53:50,897 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:54:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:54:03,328 INFO L93 Difference]: Finished difference Result 377 states and 467 transitions. [2024-11-14 05:54:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:54:03,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-14 05:54:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:54:03,332 INFO L225 Difference]: With dead ends: 377 [2024-11-14 05:54:03,333 INFO L226 Difference]: Without dead ends: 219 [2024-11-14 05:54:03,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2024-11-14 05:54:03,334 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 193 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:54:03,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 388 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-14 05:54:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-14 05:54:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2024-11-14 05:54:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 134 states have internal predecessors, (163), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:54:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2024-11-14 05:54:03,368 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 148 [2024-11-14 05:54:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:54:03,368 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2024-11-14 05:54:03,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:54:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2024-11-14 05:54:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-14 05:54:03,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:54:03,370 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:54:03,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-14 05:54:03,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 05:54:03,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:54:03,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:54:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:54:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 126748868, now seen corresponding path program 1 times [2024-11-14 05:54:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:54:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86979891] [2024-11-14 05:54:03,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:54:03,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:54:03,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:54:03,775 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:54:03,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-14 05:54:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:54:04,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 05:54:04,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:54:18,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:54:24,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:54:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:54:27,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 05:54:28,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 05:54:28,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-14 05:54:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 102 proven. 128 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-14 05:54:29,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:54:31,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_step_#t~mem36#1| (_ BitVec 16))) (bvuge (select (select (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_830) |c_~#unsigned_long_int_Array_0~0.base|) (bvadd (_ bv12 32) |c_~#unsigned_long_int_Array_0~0.offset|)) ((_ zero_extend 16) |ULTIMATE.start_step_#t~mem36#1|))) is different from false [2024-11-14 05:54:31,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:54:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86979891] [2024-11-14 05:54:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86979891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:54:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [548489215] [2024-11-14 05:54:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:54:31,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:54:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:54:31,594 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:54:31,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 05:54:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:54:32,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 05:54:32,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:54:50,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:54:50,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:54:50,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:54:55,101 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 25 treesize of output 23 [2024-11-14 05:54:57,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2024-11-14 05:54:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:54:58,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:54:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [548489215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:54:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:54:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-14 05:54:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762288553] [2024-11-14 05:54:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:54:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:54:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:54:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:54:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2024-11-14 05:54:58,263 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:55:21,919 INFO L93 Difference]: Finished difference Result 377 states and 465 transitions. [2024-11-14 05:55:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:55:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-14 05:55:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:55:21,922 INFO L225 Difference]: With dead ends: 377 [2024-11-14 05:55:21,922 INFO L226 Difference]: Without dead ends: 219 [2024-11-14 05:55:21,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2024-11-14 05:55:21,924 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:55:21,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 580 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 763 Invalid, 5 Unknown, 0 Unchecked, 22.2s Time] [2024-11-14 05:55:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-14 05:55:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 153. [2024-11-14 05:55:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 126 states have internal predecessors, (154), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:55:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-11-14 05:55:21,959 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 148 [2024-11-14 05:55:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:55:21,959 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-11-14 05:55:21,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-11-14 05:55:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-14 05:55:21,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:55:21,962 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:55:21,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-14 05:55:22,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-14 05:55:22,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:22,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:55:22,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:55:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash -412305719, now seen corresponding path program 1 times [2024-11-14 05:55:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:55:22,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309195209] [2024-11-14 05:55:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:55:22,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:22,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:55:22,366 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:55:22,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-14 05:55:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:22,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:55:22,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:55:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:55:23,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:55:23,384 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:55:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309195209] [2024-11-14 05:55:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309195209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:55:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:55:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:55:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674341722] [2024-11-14 05:55:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:55:23,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:55:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:55:23,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:55:23,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:55:23,386 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:55:24,084 INFO L93 Difference]: Finished difference Result 306 states and 381 transitions. [2024-11-14 05:55:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:55:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-14 05:55:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:55:24,086 INFO L225 Difference]: With dead ends: 306 [2024-11-14 05:55:24,087 INFO L226 Difference]: Without dead ends: 156 [2024-11-14 05:55:24,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:55:24,088 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:55:24,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:55:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-14 05:55:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-14 05:55:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.2170542635658914) internal successors, (157), 129 states have internal predecessors, (157), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:55:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-14 05:55:24,127 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 150 [2024-11-14 05:55:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:55:24,128 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-14 05:55:24,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-14 05:55:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-14 05:55:24,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:55:24,129 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:55:24,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-14 05:55:24,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:24,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:55:24,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:55:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1204285026, now seen corresponding path program 1 times [2024-11-14 05:55:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:55:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503949047] [2024-11-14 05:55:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:55:24,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:24,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:55:24,333 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:55:24,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-14 05:55:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:24,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:55:24,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:55:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-14 05:55:25,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:55:25,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:55:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503949047] [2024-11-14 05:55:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503949047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:55:25,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:55:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:55:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966889820] [2024-11-14 05:55:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:55:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:55:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:55:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:55:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:55:25,965 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:55:27,195 INFO L93 Difference]: Finished difference Result 314 states and 389 transitions. [2024-11-14 05:55:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:55:27,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-14 05:55:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:55:27,198 INFO L225 Difference]: With dead ends: 314 [2024-11-14 05:55:27,198 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 05:55:27,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:55:27,201 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:55:27,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 841 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:55:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 05:55:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-14 05:55:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 130 states have internal predecessors, (158), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-14 05:55:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2024-11-14 05:55:27,239 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 150 [2024-11-14 05:55:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:55:27,240 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2024-11-14 05:55:27,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-14 05:55:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2024-11-14 05:55:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-14 05:55:27,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:55:27,242 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:55:27,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-14 05:55:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:27,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:55:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:55:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1960738256, now seen corresponding path program 1 times [2024-11-14 05:55:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:55:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016253159] [2024-11-14 05:55:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:55:27,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:55:27,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:55:27,445 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 05:55:27,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-14 05:55:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:28,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-14 05:55:28,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:55:36,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 05:55:40,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 05:55:45,017 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 36 treesize of output 23 [2024-11-14 05:55:55,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:55:55,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 38 [2024-11-14 05:55:59,325 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 43 treesize of output 32 [2024-11-14 05:56:04,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:56:04,187 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 60 treesize of output 22 [2024-11-14 05:56:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 320 proven. 158 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-14 05:56:05,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:56:07,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:56:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016253159] [2024-11-14 05:56:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016253159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:56:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1063563416] [2024-11-14 05:56:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:56:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:56:07,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:56:07,592 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:56:07,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fd1ebe-3d32-4f06-a0ae-328eb748fbd4/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-14 05:56:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:56:09,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 05:56:09,598 INFO L278 TraceCheckSpWp]: Computing forward predicates...