./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:49:07,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:49:07,830 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:49:07,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:49:07,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:49:07,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:49:07,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:49:07,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:49:07,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:49:07,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:49:07,862 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:49:07,862 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:49:07,862 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:49:07,863 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:49:07,863 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:49:07,864 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:49:07,864 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:49:07,865 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:49:07,865 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:49:07,865 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:49:07,865 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:49:07,865 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:49:07,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:49:07,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:49:07,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:49:07,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:49:07,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:49:07,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:07,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:49:07,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:49:07,870 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:49:07,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:49:07,870 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2024-11-13 23:49:08,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:49:08,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:49:08,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:49:08,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:49:08,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:49:08,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i Unable to find full path for "g++" [2024-11-13 23:49:10,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:49:10,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:49:10,341 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-13 23:49:10,355 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/deab6bf82/4b044e8a754a4d78b4e4ebdea2efee25/FLAGf33e99e13 [2024-11-13 23:49:10,644 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/deab6bf82/4b044e8a754a4d78b4e4ebdea2efee25 [2024-11-13 23:49:10,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:49:10,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:49:10,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:10,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:49:10,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:49:10,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:10,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544a2902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10, skipping insertion in model container [2024-11-13 23:49:10,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:10,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:49:10,842 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-13 23:49:10,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:10,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:49:10,921 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-13 23:49:10,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:10,978 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:49:10,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10 WrapperNode [2024-11-13 23:49:10,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:10,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:10,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:49:10,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:49:10,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,040 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-13 23:49:11,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:11,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:49:11,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:49:11,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:49:11,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:49:11,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:49:11,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:49:11,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:49:11,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (1/1) ... [2024-11-13 23:49:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:11,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:49:11,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2024-11-13 23:49:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:49:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:49:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:49:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:49:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:49:11,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:49:11,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:49:11,903 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-13 23:49:11,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:49:12,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:49:12,484 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:49:12,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:12 BoogieIcfgContainer [2024-11-13 23:49:12,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:49:12,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:49:12,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:49:12,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:49:12,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:49:10" (1/3) ... [2024-11-13 23:49:12,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f316bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:12, skipping insertion in model container [2024-11-13 23:49:12,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:10" (2/3) ... [2024-11-13 23:49:12,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f316bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:12, skipping insertion in model container [2024-11-13 23:49:12,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:12" (3/3) ... [2024-11-13 23:49:12,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2024-11-13 23:49:12,515 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:49:12,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:49:12,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:49:12,606 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;@2c50ba46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:49:12,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:49:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 23:49:12,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:12,622 INFO L215 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:12,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1000627362, now seen corresponding path program 1 times [2024-11-13 23:49:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:49:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308364884] [2024-11-13 23:49:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:49:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:49:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140872470] [2024-11-13 23:49:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:14,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:49:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:14,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:49:14,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:49:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:49:15,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:49:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:49:16,306 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:49:16,308 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:49:16,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:49:16,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 23:49:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:49:16,519 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 23:49:16,580 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:49:16,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:49:16 BoogieIcfgContainer [2024-11-13 23:49:16,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:49:16,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:49:16,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:49:16,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:49:16,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:12" (3/4) ... [2024-11-13 23:49:16,591 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:49:16,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:49:16,596 INFO L158 Benchmark]: Toolchain (without parser) took 5945.17ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 92.7MB in the beginning and 92.3MB in the end (delta: 384.0kB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-13 23:49:16,599 INFO L158 Benchmark]: CDTParser took 1.66ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:16,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.04ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 78.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:49:16,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.76ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 75.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:16,600 INFO L158 Benchmark]: Boogie Preprocessor took 45.33ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:16,601 INFO L158 Benchmark]: RCFGBuilder took 1398.21ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 85.1MB in the end (delta: -12.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-13 23:49:16,601 INFO L158 Benchmark]: TraceAbstraction took 4096.04ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 84.4MB in the beginning and 94.1MB in the end (delta: -9.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-13 23:49:16,601 INFO L158 Benchmark]: Witness Printer took 9.12ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:16,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.04ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 78.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.76ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 75.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.33ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 72.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1398.21ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 85.1MB in the end (delta: -12.6MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4096.04ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 84.4MB in the beginning and 94.1MB in the end (delta: -9.7MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 9.12ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 92.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L40] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L41] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L42] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L95] EXPR signed_long_int_Array_0[1] [L95] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L96] EXPR signed_short_int_Array_0[2] [L96] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L97] EXPR unsigned_short_int_Array_0[2] [L97] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L108] RET updateVariables() [L109] CALL step() [L46] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[0] [L47] signed_short_int_Array_0[2] = (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]) [L49] EXPR signed_short_int_Array_0[1] [L49] signed long int stepLocal_0 = 1 * signed_short_int_Array_0[1]; [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR signed_short_int_Array_0[0] [L50] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] [L50] COND FALSE !((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > stepLocal_0) [L53] EXPR unsigned_short_int_Array_0[0] [L53] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L55] EXPR float_Array_0[0] [L55] float_Array_0[1] = float_Array_0[0] [L56] EXPR float_Array_0[0] [L56] double_Array_0[0] = float_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[0] [L58] EXPR signed_short_int_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] signed long int stepLocal_2 = signed_short_int_Array_0[1] / signed_long_int_Array_0[0]; [L59] EXPR unsigned_short_int_Array_0[0] [L59] unsigned short int stepLocal_1 = unsigned_short_int_Array_0[0]; [L60] BOOL_unsigned_char_Array_0[0] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[1] [L63] COND TRUE unsigned_short_int_Array_0[1] > stepLocal_2 [L64] EXPR unsigned_short_int_Array_0[2] [L64] COND FALSE !(stepLocal_1 > unsigned_short_int_Array_0[2]) [L67] EXPR unsigned_short_int_Array_0[0] [L67] signed_long_int_Array_0[1] = (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100-L101] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 1, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:49:16,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:49:19,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:49:19,454 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:49:19,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:49:19,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:49:19,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:49:19,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:49:19,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:49:19,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:49:19,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:49:19,506 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:49:19,506 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:49:19,506 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:49:19,507 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:49:19,507 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:49:19,507 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:49:19,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:49:19,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:49:19,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:49:19,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:49:19,510 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:49:19,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:49:19,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:49:19,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:49:19,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:49:19,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:49:19,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:49:19,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:19,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:49:19,512 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:49:19,512 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2024-11-13 23:49:19,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:49:19,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:49:19,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:49:19,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:49:19,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:49:19,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i Unable to find full path for "g++" [2024-11-13 23:49:21,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:49:22,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:49:22,064 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-13 23:49:22,075 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/b9a143a38/a596a0c4b50d48ee8a6f2f2634a18d5d/FLAG2caf3f7aa [2024-11-13 23:49:22,089 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/data/b9a143a38/a596a0c4b50d48ee8a6f2f2634a18d5d [2024-11-13 23:49:22,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:49:22,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:49:22,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:22,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:49:22,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:49:22,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5d5211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22, skipping insertion in model container [2024-11-13 23:49:22,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:49:22,252 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-13 23:49:22,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:22,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:49:22,343 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_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-13 23:49:22,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:22,419 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:49:22,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22 WrapperNode [2024-11-13 23:49:22,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:22,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:22,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:49:22,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:49:22,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,488 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 391 [2024-11-13 23:49:22,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:22,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:49:22,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:49:22,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:49:22,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:49:22,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:49:22,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:49:22,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:49:22,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (1/1) ... [2024-11-13 23:49:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:22,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:49:22,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:49:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2024-11-13 23:49:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2024-11-13 23:49:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-13 23:49:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2024-11-13 23:49:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2024-11-13 23:49:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2024-11-13 23:49:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:49:22,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:49:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:49:22,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:49:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2024-11-13 23:49:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2024-11-13 23:49:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-13 23:49:22,816 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:49:22,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:49:23,801 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-13 23:49:23,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:49:23,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:49:23,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:49:23,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:23 BoogieIcfgContainer [2024-11-13 23:49:23,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:49:23,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:49:23,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:49:23,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:49:23,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:49:22" (1/3) ... [2024-11-13 23:49:23,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c293b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:23, skipping insertion in model container [2024-11-13 23:49:23,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:22" (2/3) ... [2024-11-13 23:49:23,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c293b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:23, skipping insertion in model container [2024-11-13 23:49:23,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:23" (3/3) ... [2024-11-13 23:49:23,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2024-11-13 23:49:23,842 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:49:23,844 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:49:23,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:49:23,933 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;@168b29ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:49:23,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:49:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:49:23,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:23,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:23,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1825584446, now seen corresponding path program 1 times [2024-11-13 23:49:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:23,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869568444] [2024-11-13 23:49:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:23,974 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-13 23:49:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:23,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:23,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:24,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 23:49:24,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-13 23:49:24,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:24,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869568444] [2024-11-13 23:49:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869568444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:24,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:49:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117025799] [2024-11-13 23:49:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:49:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:49:24,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:49:24,573 INFO L87 Difference]: Start difference. First operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:49:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:24,606 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2024-11-13 23:49:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:49:24,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-13 23:49:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:24,615 INFO L225 Difference]: With dead ends: 169 [2024-11-13 23:49:24,615 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 23:49:24,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:49:24,623 INFO L432 NwaCegarLoop]: 119 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, 119 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-13 23:49:24,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:49:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 23:49:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 23:49:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-13 23:49:24,675 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2024-11-13 23:49:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:24,675 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-13 23:49:24,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:49:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-13 23:49:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:49:24,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:24,680 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:24,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 23:49:24,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:24,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:24,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1107717038, now seen corresponding path program 1 times [2024-11-13 23:49:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579997023] [2024-11-13 23:49:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:24,883 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-13 23:49:24,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:24,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:24,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:25,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:49:25,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:49:25,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:25,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:25,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579997023] [2024-11-13 23:49:25,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579997023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:25,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:49:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228734605] [2024-11-13 23:49:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:49:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:49:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:49:25,362 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:25,494 INFO L93 Difference]: Finished difference Result 170 states and 242 transitions. [2024-11-13 23:49:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:49:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 23:49:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:25,497 INFO L225 Difference]: With dead ends: 170 [2024-11-13 23:49:25,498 INFO L226 Difference]: Without dead ends: 89 [2024-11-13 23:49:25,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:49:25,501 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:25,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:49:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-13 23:49:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-13 23:49:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2024-11-13 23:49:25,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 103 [2024-11-13 23:49:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:25,520 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2024-11-13 23:49:25,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2024-11-13 23:49:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:49:25,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:25,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:25,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:25,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:25,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash -427658668, now seen corresponding path program 1 times [2024-11-13 23:49:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883946135] [2024-11-13 23:49:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:25,729 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-13 23:49:25,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:25,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:25,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:26,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:49:26,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:49:26,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:26,198 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883946135] [2024-11-13 23:49:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883946135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:26,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:49:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379072938] [2024-11-13 23:49:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:26,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:49:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:49:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:49:26,202 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:26,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:26,398 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2024-11-13 23:49:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:49:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 23:49:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:26,403 INFO L225 Difference]: With dead ends: 176 [2024-11-13 23:49:26,403 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 23:49:26,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:49:26,404 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:49:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 23:49:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-13 23:49:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-13 23:49:26,415 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2024-11-13 23:49:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:26,415 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-13 23:49:26,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-13 23:49:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:49:26,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:26,418 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:26,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 23:49:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:26,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1347348694, now seen corresponding path program 1 times [2024-11-13 23:49:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994164259] [2024-11-13 23:49:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:26,620 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-13 23:49:26,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:26,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:26,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 23:49:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:26,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:49:26,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:49:27,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:27,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:27,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994164259] [2024-11-13 23:49:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994164259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:27,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:49:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734977054] [2024-11-13 23:49:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:49:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:49:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:49:27,038 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:27,227 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-11-13 23:49:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:49:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 23:49:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:27,229 INFO L225 Difference]: With dead ends: 180 [2024-11-13 23:49:27,229 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 23:49:27,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:49:27,234 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:27,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:49:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 23:49:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-13 23:49:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:49:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-13 23:49:27,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2024-11-13 23:49:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:27,251 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-13 23:49:27,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:49:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-13 23:49:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:49:27,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:27,254 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:27,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 23:49:27,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:27,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1349195736, now seen corresponding path program 1 times [2024-11-13 23:49:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14207364] [2024-11-13 23:49:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:27,456 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-13 23:49:27,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:27,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:49:27,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 23:49:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:27,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 23:49:27,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:29,581 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-13 23:49:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 23:49:31,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:31,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 23:49:31,635 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 86 treesize of output 67 [2024-11-13 23:49:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 67 [2024-11-13 23:49:32,048 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 86 treesize of output 67 [2024-11-13 23:49:32,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:49:32,261 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 146 treesize of output 70 [2024-11-13 23:49:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 23:49:32,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:32,807 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_131) |c_~#double_Array_0~0.base| v_ArrVal_130) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_132) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_133) |c_~#signed_short_int_Array_0~0.base|))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |c_~#signed_short_int_Array_0~0.offset|))))))))) is different from false [2024-11-13 23:49:33,417 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14207364] [2024-11-13 23:49:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14207364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [150412782] [2024-11-13 23:49:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:49:33,425 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:49:33,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-13 23:49:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:34,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 23:49:34,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:35,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 23:49:37,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-13 23:49:39,765 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 61 treesize of output 46 [2024-11-13 23:49:40,539 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 80 treesize of output 58 [2024-11-13 23:49:41,394 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 108 treesize of output 81 [2024-11-13 23:49:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 81 [2024-11-13 23:49:42,052 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 108 treesize of output 81 [2024-11-13 23:49:42,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 88 [2024-11-13 23:49:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 23:49:42,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:42,628 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_167) |c_~#double_Array_0~0.base| v_ArrVal_166) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_165) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_133) |c_~#signed_short_int_Array_0~0.base|))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |c_~#signed_short_int_Array_0~0.offset|))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))))))))) is different from false [2024-11-13 23:49:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [150412782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216237847] [2024-11-13 23:49:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:51,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:49:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:51,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:49:51,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 23:49:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:51,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 23:49:51,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:57,694 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 38 treesize of output 18 [2024-11-13 23:50:03,053 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 49 treesize of output 38 [2024-11-13 23:50:04,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:04,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 54 [2024-11-13 23:50:06,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2024-11-13 23:50:06,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 81 [2024-11-13 23:50:07,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 81 [2024-11-13 23:50:08,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:50:08,346 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 164 treesize of output 80 [2024-11-13 23:50:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 173 proven. 33 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 23:50:08,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:50:08,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_202) |c_~#signed_short_int_Array_0~0.base|))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |c_~#signed_short_int_Array_0~0.offset|))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))))))))) is different from false [2024-11-13 23:50:08,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_201 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_199 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_199) |c_~#double_Array_0~0.base| v_ArrVal_200) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_201) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_202) |c_~#signed_short_int_Array_0~0.base|))) (= ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32))))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |c_~#signed_short_int_Array_0~0.offset|))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))))))))) is different from false [2024-11-13 23:50:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216237847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:11,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:50:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 25] total 59 [2024-11-13 23:50:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318975829] [2024-11-13 23:50:11,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:50:11,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-13 23:50:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-13 23:50:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=4033, Unknown=30, NotChecked=548, Total=5256 [2024-11-13 23:50:11,755 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 60 states, 50 states have (on average 2.6) internal successors, (130), 51 states have internal predecessors, (130), 15 states have call successors, (30), 13 states have call predecessors, (30), 14 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) [2024-11-13 23:50:20,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:30,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:33,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:37,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:40,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:42,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:44,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:48,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:50,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:53,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:55,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:51:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:04,190 INFO L93 Difference]: Finished difference Result 301 states and 406 transitions. [2024-11-13 23:51:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 23:51:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 50 states have (on average 2.6) internal successors, (130), 51 states have internal predecessors, (130), 15 states have call successors, (30), 13 states have call predecessors, (30), 14 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) Word has length 103 [2024-11-13 23:51:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:04,194 INFO L225 Difference]: With dead ends: 301 [2024-11-13 23:51:04,194 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 23:51:04,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 307 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3046 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=1128, Invalid=6866, Unknown=32, NotChecked=716, Total=8742 [2024-11-13 23:51:04,197 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 640 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 148 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:04,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1265 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1796 Invalid, 7 Unknown, 0 Unchecked, 44.9s Time] [2024-11-13 23:51:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 23:51:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 124. [2024-11-13 23:51:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 106 states have internal predecessors, (139), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 23:51:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-11-13 23:51:04,218 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 103 [2024-11-13 23:51:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-11-13 23:51:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 50 states have (on average 2.6) internal successors, (130), 51 states have internal predecessors, (130), 15 states have call successors, (30), 13 states have call predecessors, (30), 14 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) [2024-11-13 23:51:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-11-13 23:51:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 23:51:04,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:04,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:04,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 23:51:04,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 23:51:04,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-13 23:51:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:04,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1568050454, now seen corresponding path program 1 times [2024-11-13 23:51:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843165295] [2024-11-13 23:51:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:04,823 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-13 23:51:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:04,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:51:04,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 23:51:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:05,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:51:05,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:05,270 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 23:51:05,270 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 41 treesize of output 26 [2024-11-13 23:51:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:51:07,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:07,192 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843165295] [2024-11-13 23:51:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843165295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:51:07,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:51:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447019278] [2024-11-13 23:51:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:51:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:51:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:51:07,194 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:51:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:08,004 INFO L93 Difference]: Finished difference Result 349 states and 457 transitions. [2024-11-13 23:51:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:51:08,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 23:51:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:08,006 INFO L225 Difference]: With dead ends: 349 [2024-11-13 23:51:08,006 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 23:51:08,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:51:08,008 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 71 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:08,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 292 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 23:51:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 23:51:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 191. [2024-11-13 23:51:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 156 states have internal predecessors, (199), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 23:51:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2024-11-13 23:51:08,054 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 103 [2024-11-13 23:51:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2024-11-13 23:51:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:51:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2024-11-13 23:51:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 23:51:08,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:08,056 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:08,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-13 23:51:08,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:51:08,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1817280662, now seen corresponding path program 1 times [2024-11-13 23:51:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208979076] [2024-11-13 23:51:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:08,258 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-13 23:51:08,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:08,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:51:08,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:51:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:08,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 23:51:08,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:12,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:51:13,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:51:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2024-11-13 23:51:19,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:19,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2024-11-13 23:51:19,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:19,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 80 [2024-11-13 23:51:20,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 86 [2024-11-13 23:51:20,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2024-11-13 23:51:22,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 103 [2024-11-13 23:51:22,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-13 23:51:25,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:25,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 71 [2024-11-13 23:51:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 197 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 23:51:26,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:27,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_257) |c_~#double_Array_0~0.base| v_ArrVal_256))) (let ((.cse4 (select .cse3 |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 |c_~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse1 (store .cse3 |c_~#unsigned_short_int_Array_0~0.base| (store .cse4 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) .cse0)))) (or (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse0)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse2 (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_259) |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ extract 15 0) (select .cse2 (bvadd (_ bv4 32) |c_~#unsigned_short_int_Array_0~0.offset|)))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse2 |c_~#unsigned_short_int_Array_0~0.offset|))))))))))) is different from false [2024-11-13 23:51:27,886 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_~#unsigned_short_int_Array_0~0.offset|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| (let ((.cse5 (select |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base|))) (store .cse5 .cse3 ((_ sign_extend 16) ((_ extract 15 0) (select .cse5 |c_~#unsigned_short_int_Array_0~0.offset|)))))) |c_~#float_Array_0~0.base| v_ArrVal_257) |c_~#double_Array_0~0.base| v_ArrVal_256) |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 |c_~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_257) |c_~#double_Array_0~0.base| v_ArrVal_256) |c_~#unsigned_short_int_Array_0~0.base| (store .cse4 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) .cse0)))) (or (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse0)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse2 (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_259) |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ extract 15 0) (select .cse2 .cse3))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse2 |c_~#unsigned_short_int_Array_0~0.offset|))))))))))) is different from false [2024-11-13 23:51:28,421 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_~#unsigned_short_int_Array_0~0.offset|)) (.cse5 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (let ((.cse8 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|))) (store .cse8 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32)) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse8 |c_~#signed_short_int_Array_0~0.offset|))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse8 .cse4))))))))))) (let ((.cse6 (select (store (store (store .cse5 |c_~#unsigned_short_int_Array_0~0.base| (let ((.cse7 (select .cse5 |c_~#unsigned_short_int_Array_0~0.base|))) (store .cse7 .cse1 ((_ sign_extend 16) ((_ extract 15 0) (select .cse7 |c_~#unsigned_short_int_Array_0~0.offset|)))))) |c_~#float_Array_0~0.base| v_ArrVal_257) |c_~#double_Array_0~0.base| v_ArrVal_256) |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse3 ((_ sign_extend 16) ((_ extract 15 0) (select .cse6 |c_~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse2 (store (store (store .cse5 |c_~#float_Array_0~0.base| v_ArrVal_257) |c_~#double_Array_0~0.base| v_ArrVal_256) |c_~#unsigned_short_int_Array_0~0.base| (store .cse6 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) .cse3)))) (or (let ((.cse0 (select (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_259) |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ extract 15 0) (select .cse0 |c_~#unsigned_short_int_Array_0~0.offset|))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse0 .cse1))))) (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse3)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 |c_~#signed_short_int_Array_0~0.base|) .cse4))) (select (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2024-11-13 23:51:30,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208979076] [2024-11-13 23:51:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208979076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:51:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1429034846] [2024-11-13 23:51:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:30,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:30,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:51:30,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:51:30,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-13 23:51:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:31,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 23:51:31,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:37,086 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-13 23:51:40,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:51:41,138 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 22 [2024-11-13 23:51:41,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2024-11-13 23:51:41,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 25 [2024-11-13 23:51:42,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-13 23:51:42,933 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 63 treesize of output 35 [2024-11-13 23:51:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 23:51:42,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1429034846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:51:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [27] total 36 [2024-11-13 23:51:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873817159] [2024-11-13 23:51:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:42,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 23:51:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 23:51:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1509, Unknown=3, NotChecked=246, Total=1980 [2024-11-13 23:51:42,986 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:51:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:50,393 INFO L93 Difference]: Finished difference Result 391 states and 516 transitions. [2024-11-13 23:51:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 23:51:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-13 23:51:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:50,398 INFO L225 Difference]: With dead ends: 391 [2024-11-13 23:51:50,398 INFO L226 Difference]: Without dead ends: 270 [2024-11-13 23:51:50,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=298, Invalid=1967, Unknown=3, NotChecked=282, Total=2550 [2024-11-13 23:51:50,401 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 363 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:50,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 416 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-13 23:51:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-13 23:51:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 229. [2024-11-13 23:51:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 194 states have internal predecessors, (256), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 23:51:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 304 transitions. [2024-11-13 23:51:50,450 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 304 transitions. Word has length 105 [2024-11-13 23:51:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:50,451 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 304 transitions. [2024-11-13 23:51:50,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:51:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 304 transitions. [2024-11-13 23:51:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 23:51:50,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:50,454 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:50,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:51:50,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-13 23:51:50,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:50,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 817183855, now seen corresponding path program 1 times [2024-11-13 23:51:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916252499] [2024-11-13 23:51:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:50,857 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-13 23:51:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:50,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:51:50,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-13 23:51:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:51,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:51:51,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:55,215 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-13 23:51:57,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 23:51:59,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:59,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 23:52:00,049 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 86 treesize of output 67 [2024-11-13 23:52:00,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 67 [2024-11-13 23:52:01,194 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 86 treesize of output 67 [2024-11-13 23:52:02,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:02,270 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 106 treesize of output 46 [2024-11-13 23:52:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 23:52:02,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:52:03,835 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_326) |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 |c_~#signed_short_int_Array_0~0.offset|)))) (.cse2 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))))) (.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32))))))) (or (not (bvsgt (bvashr .cse0 .cse1) .cse2)) (not (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 .cse2))) .cse0)))))) is different from false [2024-11-13 23:52:11,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:52:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916252499] [2024-11-13 23:52:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916252499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:52:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207425095] [2024-11-13 23:52:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:52:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:52:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:52:11,388 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:52:11,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-13 23:52:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:52:12,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:52:12,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:52:19,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-13 23:52:20,681 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 56 treesize of output 41 [2024-11-13 23:52:21,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 41 [2024-11-13 23:52:21,708 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 56 treesize of output 41 [2024-11-13 23:52:23,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 36 [2024-11-13 23:52:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:52:23,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:52:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1207425095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:52:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:52:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2024-11-13 23:52:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504977151] [2024-11-13 23:52:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:52:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:52:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:52:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:52:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1060, Unknown=17, NotChecked=68, Total=1332 [2024-11-13 23:52:23,580 INFO L87 Difference]: Start difference. First operand 229 states and 304 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:52:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:52:31,837 INFO L93 Difference]: Finished difference Result 450 states and 598 transitions. [2024-11-13 23:52:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:52:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-13 23:52:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:52:31,840 INFO L225 Difference]: With dead ends: 450 [2024-11-13 23:52:31,840 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 23:52:31,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=236, Invalid=1233, Unknown=17, NotChecked=74, Total=1560 [2024-11-13 23:52:31,841 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 356 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:52:31,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 387 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-13 23:52:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 23:52:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 232. [2024-11-13 23:52:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 197 states have internal predecessors, (259), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 23:52:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 307 transitions. [2024-11-13 23:52:31,873 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 307 transitions. Word has length 107 [2024-11-13 23:52:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:52:31,874 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 307 transitions. [2024-11-13 23:52:31,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:52:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 307 transitions. [2024-11-13 23:52:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 23:52:31,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:52:31,875 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:52:31,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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)] Ended with exit code 0 [2024-11-13 23:52:32,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-13 23:52:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:52:32,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:52:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:52:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -832375057, now seen corresponding path program 1 times [2024-11-13 23:52:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:52:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554941956] [2024-11-13 23:52:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:52:32,277 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-13 23:52:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:52:32,279 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:52:32,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:52:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:52:32,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:52:32,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:52:36,222 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-13 23:52:38,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-13 23:52:39,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:39,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 23:52:41,498 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 74 treesize of output 57 [2024-11-13 23:52:41,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 57 [2024-11-13 23:52:42,053 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 74 treesize of output 57 [2024-11-13 23:52:43,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:52:43,080 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 94 treesize of output 40 [2024-11-13 23:52:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-13 23:52:43,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:52:44,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_390 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_390) |c_~#signed_short_int_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32)))))) (.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 |c_~#signed_short_int_Array_0~0.offset|)))) (.cse2 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))))) (or (not (= .cse0 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse1 .cse2))))) (bvsgt (bvashr .cse0 .cse1) .cse2))))) is different from false [2024-11-13 23:52:50,557 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:52:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554941956] [2024-11-13 23:52:50,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554941956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:52:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1463992616] [2024-11-13 23:52:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:52:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:52:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:52:50,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:52:50,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-13 23:52:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:52:51,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 23:52:51,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:52:58,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-13 23:53:00,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2024-11-13 23:53:00,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2024-11-13 23:53:00,695 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 55 treesize of output 40 [2024-11-13 23:53:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2024-11-13 23:53:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:53:02,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:53:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1463992616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:53:02,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:53:02,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2024-11-13 23:53:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685536962] [2024-11-13 23:53:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:53:02,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:53:02,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:53:02,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:53:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1068, Unknown=8, NotChecked=68, Total=1332 [2024-11-13 23:53:02,608 INFO L87 Difference]: Start difference. First operand 232 states and 307 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:53:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:53:11,634 INFO L93 Difference]: Finished difference Result 453 states and 600 transitions. [2024-11-13 23:53:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:53:11,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-13 23:53:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:53:11,637 INFO L225 Difference]: With dead ends: 453 [2024-11-13 23:53:11,637 INFO L226 Difference]: Without dead ends: 301 [2024-11-13 23:53:11,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=237, Invalid=1241, Unknown=8, NotChecked=74, Total=1560 [2024-11-13 23:53:11,638 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 230 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:53:11,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 455 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-13 23:53:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-13 23:53:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 235. [2024-11-13 23:53:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.31) internal successors, (262), 200 states have internal predecessors, (262), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 23:53:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 310 transitions. [2024-11-13 23:53:11,675 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 310 transitions. Word has length 107 [2024-11-13 23:53:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:53:11,675 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 310 transitions. [2024-11-13 23:53:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:53:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2024-11-13 23:53:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:53:11,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:53:11,676 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:53:11,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-13 23:53:11,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:12,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:12,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:53:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:53:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1595675060, now seen corresponding path program 1 times [2024-11-13 23:53:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:53:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104354949] [2024-11-13 23:53:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:12,078 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-13 23:53:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:53:12,082 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:12,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:12,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:53:12,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:14,668 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 19 treesize of output 19 [2024-11-13 23:53:14,796 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-13 23:53:15,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:15,305 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 57 treesize of output 27 [2024-11-13 23:53:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:53:15,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:53:15,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:53:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104354949] [2024-11-13 23:53:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104354949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:53:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:53:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:53:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909364332] [2024-11-13 23:53:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:53:15,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:53:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:53:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:53:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:53:15,522 INFO L87 Difference]: Start difference. First operand 235 states and 310 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:53:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:53:18,010 INFO L93 Difference]: Finished difference Result 240 states and 315 transitions. [2024-11-13 23:53:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:53:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 23:53:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:53:18,013 INFO L225 Difference]: With dead ends: 240 [2024-11-13 23:53:18,013 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 23:53:18,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:53:18,014 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:53:18,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 334 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 23:53:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 23:53:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-13 23:53:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 203 states have internal predecessors, (265), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 23:53:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 313 transitions. [2024-11-13 23:53:18,050 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 313 transitions. Word has length 109 [2024-11-13 23:53:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:53:18,051 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 313 transitions. [2024-11-13 23:53:18,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:53:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 313 transitions. [2024-11-13 23:53:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:53:18,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:53:18,052 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:53:18,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:18,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:53:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:53:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1597522102, now seen corresponding path program 1 times [2024-11-13 23:53:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:53:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793438126] [2024-11-13 23:53:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:18,254 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-13 23:53:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:53:18,256 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:18,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:18,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:53:18,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:20,414 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-13 23:53:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-13 23:53:24,414 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 57 treesize of output 42 [2024-11-13 23:53:25,861 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 57 treesize of output 42 [2024-11-13 23:53:27,228 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 57 treesize of output 42 [2024-11-13 23:53:28,880 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 57 treesize of output 42 [2024-11-13 23:53:29,260 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 57 treesize of output 42 [2024-11-13 23:53:29,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 96 [2024-11-13 23:53:29,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-11-13 23:53:30,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-13 23:53:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 [2024-11-13 23:53:30,040 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 104 treesize of output 84 [2024-11-13 23:53:31,840 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 104 treesize of output 84 [2024-11-13 23:53:39,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:53:39,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 103 [2024-11-13 23:53:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 23:53:39,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:53:39,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:53:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793438126] [2024-11-13 23:53:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793438126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:53:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:53:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 23:53:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775651867] [2024-11-13 23:53:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:53:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:53:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:53:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:53:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:53:39,868 INFO L87 Difference]: Start difference. First operand 238 states and 313 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:53:49,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:53:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:53:56,460 INFO L93 Difference]: Finished difference Result 615 states and 810 transitions. [2024-11-13 23:53:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:53:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-13 23:53:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:53:56,464 INFO L225 Difference]: With dead ends: 615 [2024-11-13 23:53:56,464 INFO L226 Difference]: Without dead ends: 457 [2024-11-13 23:53:56,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:53:56,466 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 347 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:53:56,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 453 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-11-13 23:53:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-13 23:53:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 438. [2024-11-13 23:53:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 373 states have (on average 1.3163538873994638) internal successors, (491), 373 states have internal predecessors, (491), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:53:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 579 transitions. [2024-11-13 23:53:56,513 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 579 transitions. Word has length 109 [2024-11-13 23:53:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:53:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 579 transitions. [2024-11-13 23:53:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:53:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 579 transitions. [2024-11-13 23:53:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:53:56,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:53:56,515 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:53:56,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:56,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:53:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:53:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -922437832, now seen corresponding path program 1 times [2024-11-13 23:53:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:53:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382147245] [2024-11-13 23:53:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:53:56,717 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-13 23:53:56,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:53:56,718 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:56,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:53:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:53:57,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 23:53:57,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:53:58,586 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-13 23:54:00,346 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 57 treesize of output 42 [2024-11-13 23:54:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-13 23:54:03,394 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 57 treesize of output 42 [2024-11-13 23:54:04,585 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 57 treesize of output 42 [2024-11-13 23:54:05,954 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 57 treesize of output 42 [2024-11-13 23:54:06,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 57 treesize of output 42 [2024-11-13 23:54:06,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 69 [2024-11-13 23:54:06,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 75 [2024-11-13 23:54:06,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-13 23:54:07,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:07,659 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 191 treesize of output 77 [2024-11-13 23:54:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 23:54:07,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:54:08,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_525) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) is different from false [2024-11-13 23:54:08,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_skolemized_v_prenex_3_20 (_ BitVec 32)) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_520) |c_~#float_Array_0~0.base|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse4 .cse2 v_skolemized_v_prenex_3_20)) |c_~#double_Array_0~0.base| v_ArrVal_523) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_524) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_525) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_3_20) ((_ extract 30 23) v_skolemized_v_prenex_3_20) ((_ extract 22 0) v_skolemized_v_prenex_3_20)) (let ((.cse5 (select .cse4 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from false [2024-11-13 23:54:09,333 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:54:09,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382147245] [2024-11-13 23:54:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382147245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:54:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2127030953] [2024-11-13 23:54:09,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:09,334 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:54:09,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:54:09,336 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:54:09,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-13 23:54:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:10,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:54:10,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:12,586 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-13 23:54:14,959 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 57 treesize of output 42 [2024-11-13 23:54:17,024 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 57 treesize of output 42 [2024-11-13 23:54:18,367 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 57 treesize of output 42 [2024-11-13 23:54:19,822 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 57 treesize of output 42 [2024-11-13 23:54:21,421 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 57 treesize of output 42 [2024-11-13 23:54:21,896 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 57 treesize of output 42 [2024-11-13 23:54:22,034 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 67 [2024-11-13 23:54:22,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 69 [2024-11-13 23:54:22,576 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 96 treesize of output 69 [2024-11-13 23:54:23,792 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 173 treesize of output 77 [2024-11-13 23:54:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 23:54:23,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:54:25,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_3_22 (_ BitVec 32)) (v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_557) |c_~#float_Array_0~0.base|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse1 (select (store (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse4 .cse2 v_skolemized_v_prenex_3_22)) |c_~#double_Array_0~0.base| v_ArrVal_558) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_560) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_562) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_3_22) ((_ extract 30 23) v_skolemized_v_prenex_3_22) ((_ extract 22 0) v_skolemized_v_prenex_3_22)) (let ((.cse5 (select .cse4 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))) is different from false [2024-11-13 23:54:25,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_3_22 (_ BitVec 32)) (v_ArrVal_560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_558 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_556))) (let ((.cse1 (select (store .cse6 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_557) |c_~#float_Array_0~0.base|))) (or (not (= (let ((.cse0 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) v_skolemized_v_prenex_3_22) ((_ extract 30 23) v_skolemized_v_prenex_3_22) ((_ extract 22 0) v_skolemized_v_prenex_3_22)))) (let ((.cse4 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse3 (select (store (store (store (store .cse6 |c_~#float_Array_0~0.base| (store .cse1 .cse4 v_skolemized_v_prenex_3_22)) |c_~#double_Array_0~0.base| v_ArrVal_558) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_560) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_562) |c_~#float_Array_0~0.base|))) (fp.eq (let ((.cse2 (select .cse3 .cse4))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (select .cse3 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))))))) is different from false [2024-11-13 23:54:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2127030953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:54:25,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914994555] [2024-11-13 23:54:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:25,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:54:25,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:54:25,563 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:54:25,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 23:54:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:26,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 23:54:26,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:27,923 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-13 23:54:28,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-13 23:54:30,729 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 57 treesize of output 42 [2024-11-13 23:54:31,914 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 57 treesize of output 42 [2024-11-13 23:54:33,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2024-11-13 23:54:34,453 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 57 treesize of output 42 [2024-11-13 23:54:34,608 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 57 treesize of output 42 [2024-11-13 23:54:34,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 69 [2024-11-13 23:54:34,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 75 [2024-11-13 23:54:34,855 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 102 treesize of output 75 [2024-11-13 23:54:35,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:54:35,615 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 191 treesize of output 77 [2024-11-13 23:54:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 23:54:35,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:54:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914994555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:54:38,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:54:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2024-11-13 23:54:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748957674] [2024-11-13 23:54:38,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:54:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 23:54:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:54:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 23:54:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=559, Unknown=85, NotChecked=220, Total=992 [2024-11-13 23:54:38,418 INFO L87 Difference]: Start difference. First operand 438 states and 579 transitions. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 23:54:45,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:54:48,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:54:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:54:52,549 INFO L93 Difference]: Finished difference Result 747 states and 989 transitions. [2024-11-13 23:54:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:54:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 109 [2024-11-13 23:54:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:54:52,553 INFO L225 Difference]: With dead ends: 747 [2024-11-13 23:54:52,553 INFO L226 Difference]: Without dead ends: 457 [2024-11-13 23:54:52,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=251, Invalid=870, Unknown=85, NotChecked=276, Total=1482 [2024-11-13 23:54:52,555 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 580 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:54:52,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 536 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 823 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2024-11-13 23:54:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-13 23:54:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 438. [2024-11-13 23:54:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 373 states have (on average 1.3136729222520107) internal successors, (490), 373 states have internal predecessors, (490), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:54:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 578 transitions. [2024-11-13 23:54:52,617 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 578 transitions. Word has length 109 [2024-11-13 23:54:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:54:52,618 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 578 transitions. [2024-11-13 23:54:52,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 23:54:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2024-11-13 23:54:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:54:52,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:54:52,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:54:52,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:54:52,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-13 23:54:53,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 23:54:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:54:53,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:54:53,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:54:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -242379462, now seen corresponding path program 1 times [2024-11-13 23:54:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:54:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274989264] [2024-11-13 23:54:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:54:53,222 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-13 23:54:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:54:53,223 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:54:53,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-13 23:54:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:54:53,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 23:54:53,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:54:58,748 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-13 23:54:58,923 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-13 23:54:58,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-13 23:54:59,082 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 29 treesize of output 32 [2024-11-13 23:55:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:55:00,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:55:00,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:55:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274989264] [2024-11-13 23:55:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274989264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:55:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:55:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:55:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300059780] [2024-11-13 23:55:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:55:00,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:55:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:55:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:55:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:55:00,121 INFO L87 Difference]: Start difference. First operand 438 states and 578 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:55:04,176 INFO L93 Difference]: Finished difference Result 859 states and 1135 transitions. [2024-11-13 23:55:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:55:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 23:55:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:55:04,181 INFO L225 Difference]: With dead ends: 859 [2024-11-13 23:55:04,181 INFO L226 Difference]: Without dead ends: 569 [2024-11-13 23:55:04,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:55:04,183 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 261 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:55:04,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 366 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 23:55:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-13 23:55:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 522. [2024-11-13 23:55:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 457 states have (on average 1.3085339168490153) internal successors, (598), 457 states have internal predecessors, (598), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:55:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 686 transitions. [2024-11-13 23:55:04,245 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 686 transitions. Word has length 109 [2024-11-13 23:55:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:55:04,246 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 686 transitions. [2024-11-13 23:55:04,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 686 transitions. [2024-11-13 23:55:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:55:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:55:04,247 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:55:04,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-13 23:55:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:04,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:55:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:55:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -502919805, now seen corresponding path program 1 times [2024-11-13 23:55:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:55:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308646678] [2024-11-13 23:55:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:55:04,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:55:04,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:55:04,451 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:04,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:55:04,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 23:55:04,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:55:05,311 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-13 23:55:06,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:10,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:11,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:13,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:13,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:55:13,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2024-11-13 23:55:13,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:55:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-13 23:55:14,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:55:15,739 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:55:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308646678] [2024-11-13 23:55:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308646678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:55:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704574407] [2024-11-13 23:55:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:55:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:55:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:55:15,742 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:55:15,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-13 23:55:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:55:16,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 23:55:16,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:55:16,968 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-13 23:55:17,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:55:18,651 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-13 23:55:20,047 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-13 23:55:21,003 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-13 23:55:21,960 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-13 23:55:23,082 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-13 23:55:23,372 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-13 23:55:23,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-13 23:55:23,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:55:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:55:23,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:55:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1704574407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:55:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:55:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 13 [2024-11-13 23:55:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684766512] [2024-11-13 23:55:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:55:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:55:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:55:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:55:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=237, Unknown=30, NotChecked=0, Total=342 [2024-11-13 23:55:23,920 INFO L87 Difference]: Start difference. First operand 522 states and 686 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:55:26,687 INFO L93 Difference]: Finished difference Result 1007 states and 1327 transitions. [2024-11-13 23:55:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:55:26,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 23:55:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:55:26,695 INFO L225 Difference]: With dead ends: 1007 [2024-11-13 23:55:26,695 INFO L226 Difference]: Without dead ends: 641 [2024-11-13 23:55:26,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=111, Invalid=319, Unknown=32, NotChecked=0, Total=462 [2024-11-13 23:55:26,697 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 310 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:55:26,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 218 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 23:55:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-13 23:55:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 596. [2024-11-13 23:55:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 531 states have (on average 1.2994350282485876) internal successors, (690), 531 states have internal predecessors, (690), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:55:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 778 transitions. [2024-11-13 23:55:26,787 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 778 transitions. Word has length 109 [2024-11-13 23:55:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:55:26,787 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 778 transitions. [2024-11-13 23:55:26,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 778 transitions. [2024-11-13 23:55:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:55:26,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:55:26,789 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:55:26,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-13 23:55:26,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:27,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:27,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:55:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:55:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1876302156, now seen corresponding path program 1 times [2024-11-13 23:55:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:55:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579206037] [2024-11-13 23:55:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:55:27,191 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-13 23:55:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:55:27,196 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:27,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-13 23:55:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:55:27,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 23:55:27,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:55:32,143 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-13 23:55:33,009 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-13 23:55:33,407 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 24 treesize of output 24 [2024-11-13 23:55:33,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-13 23:55:33,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:55:33,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-11-13 23:55:33,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-13 23:55:34,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:55:34,147 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 43 treesize of output 23 [2024-11-13 23:55:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:55:34,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:55:34,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:55:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579206037] [2024-11-13 23:55:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579206037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:55:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:55:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 23:55:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987992088] [2024-11-13 23:55:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:55:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 23:55:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:55:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 23:55:34,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:55:34,610 INFO L87 Difference]: Start difference. First operand 596 states and 778 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:55:42,191 INFO L93 Difference]: Finished difference Result 1285 states and 1697 transitions. [2024-11-13 23:55:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:55:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 23:55:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:55:42,197 INFO L225 Difference]: With dead ends: 1285 [2024-11-13 23:55:42,197 INFO L226 Difference]: Without dead ends: 853 [2024-11-13 23:55:42,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-11-13 23:55:42,199 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 273 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:55:42,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 542 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-13 23:55:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-13 23:55:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 746. [2024-11-13 23:55:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 681 states have (on average 1.3215859030837005) internal successors, (900), 681 states have internal predecessors, (900), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:55:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 988 transitions. [2024-11-13 23:55:42,277 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 988 transitions. Word has length 109 [2024-11-13 23:55:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:55:42,278 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 988 transitions. [2024-11-13 23:55:42,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:55:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 988 transitions. [2024-11-13 23:55:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:55:42,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:55:42,280 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:55:42,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-13 23:55:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:42,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:55:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:55:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1138801462, now seen corresponding path program 1 times [2024-11-13 23:55:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:55:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787155260] [2024-11-13 23:55:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:55:42,482 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-13 23:55:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:55:42,484 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:42,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:55:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:55:42,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-13 23:55:42,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:55: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-13 23:55:46,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:55:47,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-13 23:55:48,973 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 28 treesize of output 26 [2024-11-13 23:55:50,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:55:50,335 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 51 treesize of output 50 [2024-11-13 23:55:51,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2024-11-13 23:55:51,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2024-11-13 23:55:51,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 19 [2024-11-13 23:55:52,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-13 23:55:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-13 23:55:54,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:55:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 36 [2024-11-13 23:56:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 177 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-13 23:56:07,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:56:12,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse2 (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_773) |c_~#double_Array_0~0.base| v_ArrVal_770))) (let ((.cse3 (select .cse2 |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse3 |~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse1 (store .cse2 |c_~#unsigned_short_int_Array_0~0.base| (store .cse3 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)) .cse0)))) (or (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse0)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (bvsgt (bvadd (bvneg ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_774) |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)))) (_ bv42286 32)) (_ bv0 32)))))))) is different from false [2024-11-13 23:56:12,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_769) |c_~#float_Array_0~0.base| v_ArrVal_773) |c_~#double_Array_0~0.base| v_ArrVal_770) |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse0 ((_ sign_extend 16) ((_ extract 15 0) (select .cse2 |~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse1 (store (store (store |c_#memory_int| |c_~#float_Array_0~0.base| v_ArrVal_773) |c_~#double_Array_0~0.base| v_ArrVal_770) |c_~#unsigned_short_int_Array_0~0.base| (store .cse2 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)) .cse0)))) (or (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse0)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse1 |c_~#signed_short_int_Array_0~0.base|) (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32))))) (select (select .cse1 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|))) (bvsgt (bvadd (bvneg ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse1 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_774) |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)))) (_ bv42286 32)) (_ bv0 32))))))) is different from false [2024-11-13 23:56:13,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_770 (Array (_ BitVec 32) (_ BitVec 32))) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_769 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv2 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| (let ((.cse5 (select |c_#memory_int| |c_~#signed_short_int_Array_0~0.base|))) (store .cse5 (bvadd |c_~#signed_short_int_Array_0~0.offset| (_ bv4 32)) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select .cse5 |c_~#signed_short_int_Array_0~0.offset|))) ((_ sign_extend 16) ((_ extract 15 0) (select .cse5 .cse2))))))))))) (let ((.cse4 (select (store (store (store .cse3 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_769) |c_~#float_Array_0~0.base| v_ArrVal_773) |c_~#double_Array_0~0.base| v_ArrVal_770) |c_~#unsigned_short_int_Array_0~0.base|))) (let ((.cse1 ((_ sign_extend 16) ((_ extract 15 0) (select .cse4 |~#unsigned_short_int_Array_0~0.offset|))))) (let ((.cse0 (store (store (store .cse3 |c_~#float_Array_0~0.base| v_ArrVal_773) |c_~#double_Array_0~0.base| v_ArrVal_770) |c_~#unsigned_short_int_Array_0~0.base| (store .cse4 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)) .cse1)))) (or (bvsgt (bvadd (bvneg ((_ zero_extend 16) ((_ extract 15 0) (select (select (store .cse0 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_774) |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)))) (_ bv42286 32)) (_ bv0 32)) (bvsgt ((_ zero_extend 16) ((_ extract 15 0) .cse1)) (bvsdiv ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 |c_~#signed_short_int_Array_0~0.base|) .cse2))) (select (select .cse0 |c_~#signed_long_int_Array_0~0.base|) |c_~#signed_long_int_Array_0~0.offset|)))))))))) is different from false [2024-11-13 23:56:13,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:56:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787155260] [2024-11-13 23:56:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787155260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:56:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [340751945] [2024-11-13 23:56:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:56:13,847 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:56:13,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:56:13,849 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:56:13,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-13 23:56:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:56:15,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 23:56:15,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:56:20,869 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-13 23:56:28,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:56:30,869 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 22 [2024-11-13 23:56:31,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2024-11-13 23:56:31,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2024-11-13 23:56:34,381 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 40 treesize of output 29 [2024-11-13 23:56:36,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-13 23:56:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 23:56:40,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:56:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [340751945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:56:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:56:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2024-11-13 23:56:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824443159] [2024-11-13 23:56:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:56:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:56:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:56:40,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:56:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=708, Unknown=5, NotChecked=168, Total=992 [2024-11-13 23:56:40,964 INFO L87 Difference]: Start difference. First operand 746 states and 988 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:56:43,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:45,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:48,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:51,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:53,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:55,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:56:58,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:00,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:02,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:03,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:06,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:09,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:11,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:12,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:17,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:20,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:26,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:29,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:31,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:33,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:41,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:44,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:45,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:46,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:57:48,860 INFO L93 Difference]: Finished difference Result 1306 states and 1740 transitions. [2024-11-13 23:57:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:57:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-13 23:57:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:57:48,866 INFO L225 Difference]: With dead ends: 1306 [2024-11-13 23:57:48,866 INFO L226 Difference]: Without dead ends: 754 [2024-11-13 23:57:48,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=168, Invalid=960, Unknown=6, NotChecked=198, Total=1332 [2024-11-13 23:57:48,868 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 173 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 24 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.9s IncrementalHoareTripleChecker+Time [2024-11-13 23:57:48,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 276 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 59.9s Time] [2024-11-13 23:57:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-13 23:57:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 746. [2024-11-13 23:57:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 681 states have (on average 1.303964757709251) internal successors, (888), 681 states have internal predecessors, (888), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:57:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 976 transitions. [2024-11-13 23:57:48,943 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 976 transitions. Word has length 109 [2024-11-13 23:57:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:57:48,944 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 976 transitions. [2024-11-13 23:57:48,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:57:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 976 transitions. [2024-11-13 23:57:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:57:48,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:57:48,946 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:57:48,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-13 23:57:49,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:57:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:57:49,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:57:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:57:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1735753546, now seen corresponding path program 1 times [2024-11-13 23:57:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:57:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403017348] [2024-11-13 23:57:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:57:49,348 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-13 23:57:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:57:49,350 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:57:49,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:57:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:57:49,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:57:49,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:57:51,444 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-13 23:57:52,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:57:52,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 23:57:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 23:57:52,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:57:52,637 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:57:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403017348] [2024-11-13 23:57:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403017348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:57:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:57:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:57:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794423257] [2024-11-13 23:57:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:57:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:57:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:57:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:57:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:57:52,639 INFO L87 Difference]: Start difference. First operand 746 states and 976 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:57:54,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:57:57,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:00,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:04,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:07,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:10,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:12,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:14,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:17,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:58:18,336 INFO L93 Difference]: Finished difference Result 1198 states and 1564 transitions. [2024-11-13 23:58:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:58:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-13 23:58:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:58:18,341 INFO L225 Difference]: With dead ends: 1198 [2024-11-13 23:58:18,341 INFO L226 Difference]: Without dead ends: 616 [2024-11-13 23:58:18,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-13 23:58:18,343 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:58:18,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 308 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 7 Unknown, 0 Unchecked, 25.2s Time] [2024-11-13 23:58:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-13 23:58:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2024-11-13 23:58:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 543 states have (on average 1.270718232044199) internal successors, (690), 543 states have internal predecessors, (690), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:58:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 778 transitions. [2024-11-13 23:58:18,428 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 778 transitions. Word has length 109 [2024-11-13 23:58:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:58:18,429 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 778 transitions. [2024-11-13 23:58:18,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:58:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 778 transitions. [2024-11-13 23:58:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 23:58:18,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:58:18,431 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:58:18,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:18,632 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:58:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:58:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1569021812, now seen corresponding path program 1 times [2024-11-13 23:58:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:58:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640149236] [2024-11-13 23:58:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:58:18,634 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-13 23:58:18,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:58:18,636 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:18,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:58:19,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:58:19,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:58:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 23:58:19,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:58:19,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:58:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640149236] [2024-11-13 23:58:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640149236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:58:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:58:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:58:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577304967] [2024-11-13 23:58:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:58:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:58:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:58:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:58:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:58:19,277 INFO L87 Difference]: Start difference. First operand 608 states and 778 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:58:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:58:19,456 INFO L93 Difference]: Finished difference Result 1126 states and 1444 transitions. [2024-11-13 23:58:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:58:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-13 23:58:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:58:19,459 INFO L225 Difference]: With dead ends: 1126 [2024-11-13 23:58:19,459 INFO L226 Difference]: Without dead ends: 608 [2024-11-13 23:58:19,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:58:19,461 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:58:19,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:58:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-13 23:58:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-13 23:58:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 543 states have (on average 1.267034990791897) internal successors, (688), 543 states have internal predecessors, (688), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:58:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 776 transitions. [2024-11-13 23:58:19,530 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 776 transitions. Word has length 109 [2024-11-13 23:58:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:58:19,531 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 776 transitions. [2024-11-13 23:58:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 23:58:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 776 transitions. [2024-11-13 23:58:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 23:58:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:58:19,534 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:58:19,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:19,735 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:58:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:58:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -701307857, now seen corresponding path program 1 times [2024-11-13 23:58:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:58:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283179220] [2024-11-13 23:58:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:58:19,736 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-13 23:58:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:58:19,739 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:19,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:58:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:58:20,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 23:58:20,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:58:23,899 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-13 23:58:24,641 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-13 23:58:25,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:25,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2024-11-13 23:58:25,848 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 36 treesize of output 27 [2024-11-13 23:58:26,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2024-11-13 23:58:28,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:28,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 62 [2024-11-13 23:58:30,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:58:30,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 32 [2024-11-13 23:58:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:58:31,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:58:31,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:58:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283179220] [2024-11-13 23:58:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283179220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:58:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:58:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:58:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149637493] [2024-11-13 23:58:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:58:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:58:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:58:31,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:58:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:58:31,067 INFO L87 Difference]: Start difference. First operand 608 states and 776 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:58:42,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:58:45,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:58:51,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:57,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:58:59,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:59:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:59:01,986 INFO L93 Difference]: Finished difference Result 1224 states and 1553 transitions. [2024-11-13 23:59:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:59:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 23:59:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:59:01,990 INFO L225 Difference]: With dead ends: 1224 [2024-11-13 23:59:01,991 INFO L226 Difference]: Without dead ends: 780 [2024-11-13 23:59:01,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=39, Invalid=92, Unknown=1, NotChecked=0, Total=132 [2024-11-13 23:59:01,992 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 157 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:59:01,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 304 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 409 Invalid, 5 Unknown, 0 Unchecked, 26.4s Time] [2024-11-13 23:59:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-13 23:59:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 650. [2024-11-13 23:59:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 585 states have (on average 1.2547008547008547) internal successors, (734), 585 states have internal predecessors, (734), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:59:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 822 transitions. [2024-11-13 23:59:02,072 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 822 transitions. Word has length 110 [2024-11-13 23:59:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:59:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 822 transitions. [2024-11-13 23:59:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 822 transitions. [2024-11-13 23:59:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 23:59:02,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:59:02,080 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:59:02,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-13 23:59:02,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:59:02,281 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:59:02,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:59:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1596594620, now seen corresponding path program 1 times [2024-11-13 23:59:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:59:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306418736] [2024-11-13 23:59:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:59:02,282 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-13 23:59:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:59:02,284 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:59:02,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (30)] Waiting until timeout for monitored process [2024-11-13 23:59:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:59:02,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 23:59:02,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:59:03,157 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-13 23:59:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:05,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:07,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:08,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:09,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 18 treesize of output 13 [2024-11-13 23:59:10,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:11,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:11,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2024-11-13 23:59:11,799 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-13 23:59:12,218 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 27 treesize of output 15 [2024-11-13 23:59:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-13 23:59:12,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:59:12,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_930) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))) is different from false [2024-11-13 23:59:13,721 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:59:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306418736] [2024-11-13 23:59:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306418736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:59:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2082918643] [2024-11-13 23:59:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:59:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:59:13,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:59:13,724 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:59:13,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-13 23:59:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:59:14,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 23:59:14,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:59:14,984 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-13 23:59:15,848 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-13 23:59:16,575 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-13 23:59:17,921 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-13 23:59:18,861 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-13 23:59:19,865 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-13 23:59:20,877 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-13 23:59:21,183 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-13 23:59:21,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-13 23:59:21,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 23:59:22,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-13 23:59:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:59:23,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:59:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2082918643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:59:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:59:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-13 23:59:23,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312932254] [2024-11-13 23:59:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:59:23,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:59:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:59:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:59:23,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=312, Unknown=23, NotChecked=38, Total=462 [2024-11-13 23:59:23,772 INFO L87 Difference]: Start difference. First operand 650 states and 822 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:59:26,870 INFO L93 Difference]: Finished difference Result 1161 states and 1472 transitions. [2024-11-13 23:59:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:59:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 23:59:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:59:26,874 INFO L225 Difference]: With dead ends: 1161 [2024-11-13 23:59:26,874 INFO L226 Difference]: Without dead ends: 683 [2024-11-13 23:59:26,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=119, Invalid=412, Unknown=25, NotChecked=44, Total=600 [2024-11-13 23:59:26,876 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 139 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:59:26,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 254 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-13 23:59:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-13 23:59:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 650. [2024-11-13 23:59:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 585 states have (on average 1.2512820512820513) internal successors, (732), 585 states have internal predecessors, (732), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-13 23:59:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 820 transitions. [2024-11-13 23:59:26,950 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 820 transitions. Word has length 110 [2024-11-13 23:59:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:59:26,950 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 820 transitions. [2024-11-13 23:59:26,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 820 transitions. [2024-11-13 23:59:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 23:59:26,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:59:26,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:59:26,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (30)] Forceful destruction successful, exit code 0 [2024-11-13 23:59:27,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-13 23:59:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:59:27,354 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:59:27,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:59:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1336054277, now seen corresponding path program 1 times [2024-11-13 23:59:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:59:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491529248] [2024-11-13 23:59:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:59:27,355 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-13 23:59:27,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:59:27,357 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:59:27,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-13 23:59:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:59:27,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:59:27,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:59:27,815 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 9 treesize of output 3 [2024-11-13 23:59:28,913 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 13 treesize of output 9 [2024-11-13 23:59:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:59:29,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:59:29,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:59:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491529248] [2024-11-13 23:59:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491529248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:59:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:59:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:59:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896542508] [2024-11-13 23:59:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:59:29,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:59:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:59:29,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:59:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:59:29,777 INFO L87 Difference]: Start difference. First operand 650 states and 820 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:59:33,535 INFO L93 Difference]: Finished difference Result 1740 states and 2202 transitions. [2024-11-13 23:59:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:59:33,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 23:59:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:59:33,541 INFO L225 Difference]: With dead ends: 1740 [2024-11-13 23:59:33,541 INFO L226 Difference]: Without dead ends: 1262 [2024-11-13 23:59:33,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-13 23:59:33,543 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 97 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:59:33,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 981 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 23:59:33,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-13 23:59:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 918. [2024-11-13 23:59:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 821 states have (on average 1.2399512789281364) internal successors, (1018), 821 states have internal predecessors, (1018), 66 states have call successors, (66), 30 states have call predecessors, (66), 30 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 23:59:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1150 transitions. [2024-11-13 23:59:33,643 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1150 transitions. Word has length 110 [2024-11-13 23:59:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:59:33,643 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1150 transitions. [2024-11-13 23:59:33,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1150 transitions. [2024-11-13 23:59:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 23:59:33,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:59:33,645 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:59:33,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2024-11-13 23:59:33,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:59:33,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:59:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:59:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1922860291, now seen corresponding path program 1 times [2024-11-13 23:59:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:59:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170139481] [2024-11-13 23:59:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:59:33,847 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-13 23:59:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:59:33,849 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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-13 23:59:33,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-13 23:59:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:59:34,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 23:59:34,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:59:37,537 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-13 23:59:37,896 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 21 treesize of output 16 [2024-11-13 23:59:38,314 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 23 treesize of output 11 [2024-11-13 23:59:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 23:59:42,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:59:42,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:59:42,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170139481] [2024-11-13 23:59:42,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170139481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:59:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:59:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:59:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473787473] [2024-11-13 23:59:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:59:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:59:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:59:42,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:59:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=38, Unknown=2, NotChecked=0, Total=56 [2024-11-13 23:59:42,451 INFO L87 Difference]: Start difference. First operand 918 states and 1150 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 23:59:46,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:59:48,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:59:54,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:59:58,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:00,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:02,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:05,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:07,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:10,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:12,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:13,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 00:00:14,367 INFO L93 Difference]: Finished difference Result 1858 states and 2303 transitions. [2024-11-14 00:00:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 00:00:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-14 00:00:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 00:00:14,373 INFO L225 Difference]: With dead ends: 1858 [2024-11-14 00:00:14,373 INFO L226 Difference]: Without dead ends: 1124 [2024-11-14 00:00:14,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=28, Invalid=58, Unknown=4, NotChecked=0, Total=90 [2024-11-14 00:00:14,378 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 120 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 6 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2024-11-14 00:00:14,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 385 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 410 Invalid, 10 Unknown, 0 Unchecked, 27.6s Time] [2024-11-14 00:00:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-14 00:00:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 944. [2024-11-14 00:00:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 847 states have (on average 1.2325855962219598) internal successors, (1044), 847 states have internal predecessors, (1044), 66 states have call successors, (66), 30 states have call predecessors, (66), 30 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-14 00:00:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1176 transitions. [2024-11-14 00:00:14,495 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1176 transitions. Word has length 110 [2024-11-14 00:00:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 00:00:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1176 transitions. [2024-11-14 00:00:14,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1176 transitions. [2024-11-14 00:00:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-14 00:00:14,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 00:00:14,498 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 00:00:14,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2024-11-14 00:00:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:14,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 00:00:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 00:00:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1470067783, now seen corresponding path program 1 times [2024-11-14 00:00:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 00:00:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115628409] [2024-11-14 00:00:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:00:14,700 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 00:00:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 00:00:14,702 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:14,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (34)] Waiting until timeout for monitored process [2024-11-14 00:00:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:00:15,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 00:00:15,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:00:18,379 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 00:00:18,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 00:00:19,150 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 22 treesize of output 10 [2024-11-14 00:00:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 00:00:19,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 00:00:19,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 00:00:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115628409] [2024-11-14 00:00:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115628409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 00:00:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 00:00:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 00:00:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665474486] [2024-11-14 00:00:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 00:00:19,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 00:00:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 00:00:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 00:00:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 00:00:19,299 INFO L87 Difference]: Start difference. First operand 944 states and 1176 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 00:00:24,483 INFO L93 Difference]: Finished difference Result 1628 states and 2014 transitions. [2024-11-14 00:00:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 00:00:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-14 00:00:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 00:00:24,488 INFO L225 Difference]: With dead ends: 1628 [2024-11-14 00:00:24,488 INFO L226 Difference]: Without dead ends: 1150 [2024-11-14 00:00:24,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-14 00:00:24,490 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 91 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-14 00:00:24,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 430 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-14 00:00:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-14 00:00:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 970. [2024-11-14 00:00:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 873 states have (on average 1.2256586483390608) internal successors, (1070), 873 states have internal predecessors, (1070), 66 states have call successors, (66), 30 states have call predecessors, (66), 30 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-14 00:00:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1202 transitions. [2024-11-14 00:00:24,617 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1202 transitions. Word has length 110 [2024-11-14 00:00:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 00:00:24,617 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1202 transitions. [2024-11-14 00:00:24,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1202 transitions. [2024-11-14 00:00:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-14 00:00:24,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 00:00:24,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 00:00:24,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (34)] Ended with exit code 0 [2024-11-14 00:00:24,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:24,820 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 00:00:24,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 00:00:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2056873797, now seen corresponding path program 1 times [2024-11-14 00:00:24,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 00:00:24,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227165408] [2024-11-14 00:00:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:00:24,821 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 00:00:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 00:00:24,823 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:24,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-14 00:00:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:00:25,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 00:00:25,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:00:27,528 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 21 treesize of output 21 [2024-11-14 00:00:28,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-14 00:00:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 00:00:28,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 00:00:28,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 00:00:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227165408] [2024-11-14 00:00:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227165408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 00:00:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 00:00:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 00:00:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066133721] [2024-11-14 00:00:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 00:00:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 00:00:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 00:00:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 00:00:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-14 00:00:28,518 INFO L87 Difference]: Start difference. First operand 970 states and 1202 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:33,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 00:00:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 00:00:36,648 INFO L93 Difference]: Finished difference Result 1571 states and 1962 transitions. [2024-11-14 00:00:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 00:00:36,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-14 00:00:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 00:00:36,652 INFO L225 Difference]: With dead ends: 1571 [2024-11-14 00:00:36,652 INFO L226 Difference]: Without dead ends: 1093 [2024-11-14 00:00:36,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-14 00:00:36,654 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 96 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-14 00:00:36,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 646 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 539 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-11-14 00:00:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-11-14 00:00:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1052. [2024-11-14 00:00:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 955 states have (on average 1.2272251308900524) internal successors, (1172), 955 states have internal predecessors, (1172), 66 states have call successors, (66), 30 states have call predecessors, (66), 30 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-14 00:00:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1304 transitions. [2024-11-14 00:00:36,773 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1304 transitions. Word has length 110 [2024-11-14 00:00:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 00:00:36,774 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1304 transitions. [2024-11-14 00:00:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1304 transitions. [2024-11-14 00:00:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-14 00:00:36,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 00:00:36,776 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 00:00:36,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-11-14 00:00:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:36,976 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 00:00:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 00:00:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash -926154932, now seen corresponding path program 1 times [2024-11-14 00:00:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 00:00:36,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180038185] [2024-11-14 00:00:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:00:36,977 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 00:00:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 00:00:36,980 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:00:36,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (36)] Waiting until timeout for monitored process [2024-11-14 00:00:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:00:37,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 00:00:37,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:00:41,243 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 00:00:41,984 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 00:00:42,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:42,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2024-11-14 00:00:43,179 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 36 treesize of output 27 [2024-11-14 00:00:43,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2024-11-14 00:00:44,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:44,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 63 [2024-11-14 00:00:47,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:00:47,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 33 [2024-11-14 00:00:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 00:00:47,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 00:00:47,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 00:00:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180038185] [2024-11-14 00:00:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180038185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 00:00:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 00:00:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 00:00:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267291913] [2024-11-14 00:00:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 00:00:47,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 00:00:47,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 00:00:47,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 00:00:47,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 00:00:47,855 INFO L87 Difference]: Start difference. First operand 1052 states and 1304 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:00:57,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 00:01:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 00:01:02,880 INFO L93 Difference]: Finished difference Result 1797 states and 2227 transitions. [2024-11-14 00:01:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 00:01:02,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-14 00:01:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 00:01:02,884 INFO L225 Difference]: With dead ends: 1797 [2024-11-14 00:01:02,884 INFO L226 Difference]: Without dead ends: 1237 [2024-11-14 00:01:02,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-14 00:01:02,886 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 174 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-14 00:01:02,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 316 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2024-11-14 00:01:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-14 00:01:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1066. [2024-11-14 00:01:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 969 states have (on average 1.2239422084623324) internal successors, (1186), 969 states have internal predecessors, (1186), 66 states have call successors, (66), 30 states have call predecessors, (66), 30 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-14 00:01:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1318 transitions. [2024-11-14 00:01:02,989 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1318 transitions. Word has length 111 [2024-11-14 00:01:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 00:01:02,989 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1318 transitions. [2024-11-14 00:01:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-14 00:01:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1318 transitions. [2024-11-14 00:01:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-14 00:01:02,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 00:01:02,991 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 00:01:03,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (36)] Ended with exit code 0 [2024-11-14 00:01:03,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:01:03,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 00:01:03,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 00:01:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash -311527152, now seen corresponding path program 1 times [2024-11-14 00:01:03,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 00:01:03,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716921232] [2024-11-14 00:01:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:01:03,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 00:01:03,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 00:01:03,196 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 00:01:03,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/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 (37)] Waiting until timeout for monitored process [2024-11-14 00:01:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:01:03,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 00:01:03,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:01:05,262 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 00:01:07,835 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 55 treesize of output 40 [2024-11-14 00:01:09,965 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 55 treesize of output 40 [2024-11-14 00:01:11,398 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 55 treesize of output 40 [2024-11-14 00:01:12,942 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 55 treesize of output 40 [2024-11-14 00:01:14,606 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 55 treesize of output 40 [2024-11-14 00:01:15,004 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 55 treesize of output 40 [2024-11-14 00:01:15,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 94 [2024-11-14 00:01:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2024-11-14 00:01:15,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 47 [2024-11-14 00:01:15,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2024-11-14 00:01:15,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-14 00:01:17,110 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 102 treesize of output 82 [2024-11-14 00:01:24,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:01:24,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 101 [2024-11-14 00:01:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 89 proven. 27 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 00:01:24,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 00:01:35,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_property_#t~mem97#1_55| (_ FloatingPoint 8 24)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse4 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (not (fp.eq |v_ULTIMATE.start_property_#t~mem97#1_55| .cse0)) (fp.eq (let ((.cse1 (let ((.cse2 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse2 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse2 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) c_currentRoundingMode .cse0)))))) is different from false [2024-11-14 00:01:37,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_122| (_ BitVec 64)) (v_skolemized_v_prenex_3_42 (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem97#1_55| (_ FloatingPoint 8 24)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (.cse2 (select |c_#memory_int| |c_~#float_Array_0~0.base|))) (let ((.cse6 (store (store (let ((.cse8 (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|) v_skolemized_v_prenex_3_42)))) (store .cse8 |c_~#double_Array_0~0.base| (store (store (select .cse8 |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_122|)) .cse5 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_122|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1143) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1144))) (let ((.cse0 (let ((.cse7 (select (select .cse6 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.eq |v_ULTIMATE.start_property_#t~mem97#1_55| .cse0)) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (select .cse2 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_122|)))) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse6 |c_~#double_Array_0~0.base|))) (concat (select .cse4 .cse5) (select .cse4 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode .cse0))))))) is different from false [2024-11-14 00:01:40,186 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_122| (_ BitVec 64)) (v_skolemized_v_prenex_3_42 (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem97#1_55| (_ FloatingPoint 8 24)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1140))) (let ((.cse2 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (.cse6 (select .cse9 |c_~#float_Array_0~0.base|))) (let ((.cse3 (store (store (let ((.cse8 (store .cse6 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|) v_skolemized_v_prenex_3_42))) (store (store |c_#memory_int| |c_~#float_Array_0~0.base| .cse8) |c_~#double_Array_0~0.base| (store (store (select (store .cse9 |c_~#float_Array_0~0.base| .cse8) |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_122|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_122|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1143) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1144))) (let ((.cse4 (let ((.cse7 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_122|)))) (not (fp.eq |v_ULTIMATE.start_property_#t~mem97#1_55| .cse4)))))))) is different from false [2024-11-14 00:01:44,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_122| (_ BitVec 64)) (v_skolemized_v_prenex_3_42 (_ BitVec 32)) (|v_ULTIMATE.start_property_#t~mem97#1_55| (_ FloatingPoint 8 24)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (|~#double_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1139))) (let ((.cse10 (store .cse8 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1140))) (let ((.cse2 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (.cse6 (select .cse10 |c_~#float_Array_0~0.base|))) (let ((.cse3 (store (store (let ((.cse9 (store .cse6 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|) v_skolemized_v_prenex_3_42))) (store (store .cse8 |c_~#float_Array_0~0.base| .cse9) |c_~#double_Array_0~0.base| (store (store (select (store .cse10 |c_~#float_Array_0~0.base| .cse9) |c_~#double_Array_0~0.base|) |~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_122|)) .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_122|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1143) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1144))) (let ((.cse4 (let ((.cse7 (select (select .cse3 |c_~#float_Array_0~0.base|) |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.eq (let ((.cse0 (let ((.cse1 (select .cse3 |c_~#double_Array_0~0.base|))) (concat (select .cse1 .cse2) (select .cse1 |~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (not (= ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse6 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_122|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_122|)))) (not (fp.eq |v_ULTIMATE.start_property_#t~mem97#1_55| .cse4))))))))) is different from false [2024-11-14 00:01:49,044 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 00:01:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716921232] [2024-11-14 00:01:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716921232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 00:01:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [935365285] [2024-11-14 00:01:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:01:49,045 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 00:01:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 00:01:49,047 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 00:01:49,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 00:01:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:01:51,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 00:01:51,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:01:53,582 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 00:02:03,900 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 55 treesize of output 40 [2024-11-14 00:02:07,541 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 55 treesize of output 40 [2024-11-14 00:02:10,363 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 55 treesize of output 40 [2024-11-14 00:02:12,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2024-11-14 00:02:16,182 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 55 treesize of output 40 [2024-11-14 00:02:17,477 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 55 treesize of output 40 [2024-11-14 00:02:17,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 111 [2024-11-14 00:02:17,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2024-11-14 00:02:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2024-11-14 00:02:18,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 103 treesize of output 74 [2024-11-14 00:02:18,256 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 139 treesize of output 107 [2024-11-14 00:02:21,518 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 139 treesize of output 107 [2024-11-14 00:02:36,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 116 [2024-11-14 00:02:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 89 proven. 27 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-14 00:02:37,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 00:02:46,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1181))) (let ((.cse1 (select .cse5 |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.eq (let ((.cse0 (select .cse1 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse2)) (fp.eq (let ((.cse3 (let ((.cse4 (select .cse5 |c_~#double_Array_0~0.base|))) (concat (select .cse4 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (select .cse4 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) ((_ to_fp 11 53) c_currentRoundingMode .cse2))))))) is different from false [2024-11-14 00:02:51,314 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_3_44 (_ BitVec 32)) (v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_127| (_ BitVec 64)) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (.cse11 (select |c_#memory_int| |c_~#float_Array_0~0.base|)) (.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse8 (store (store (let ((.cse12 (store |c_#memory_int| |c_~#float_Array_0~0.base| (store .cse11 .cse3 v_skolemized_v_prenex_3_44)))) (store .cse12 |c_~#double_Array_0~0.base| (store (store (select .cse12 |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_127|)) .cse7 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_127|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1177) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1181))) (let ((.cse2 (select .cse8 |c_~#float_Array_0~0.base|))) (let ((.cse0 (let ((.cse10 (select .cse11 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse4 (let ((.cse9 (select .cse2 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (= ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_127|)))) (not (= .cse0 (fp ((_ extract 31 31) v_skolemized_v_prenex_3_44) ((_ extract 30 23) v_skolemized_v_prenex_3_44) ((_ extract 22 0) v_skolemized_v_prenex_3_44)))) (not (fp.eq (let ((.cse1 (select .cse2 .cse3))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse4)) (fp.eq (let ((.cse5 (let ((.cse6 (select .cse8 |c_~#double_Array_0~0.base|))) (concat (select .cse6 .cse7) (select .cse6 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) c_currentRoundingMode .cse4)))))))) is different from false [2024-11-14 00:02:56,163 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_3_44 (_ BitVec 32)) (v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_127| (_ BitVec 64)) (v_ArrVal_1176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1176))) (let ((.cse7 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (.cse11 (select .cse13 |c_~#float_Array_0~0.base|)) (.cse3 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse8 (store (store (let ((.cse12 (store .cse11 .cse3 v_skolemized_v_prenex_3_44))) (store (store |c_#memory_int| |c_~#float_Array_0~0.base| .cse12) |c_~#double_Array_0~0.base| (store (store (select (store .cse13 |c_~#float_Array_0~0.base| .cse12) |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_127|)) .cse7 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_127|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1177) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1181))) (let ((.cse2 (select .cse8 |c_~#float_Array_0~0.base|))) (let ((.cse0 (let ((.cse10 (select .cse11 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse4 (let ((.cse9 (select .cse2 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (= .cse0 (fp ((_ extract 31 31) v_skolemized_v_prenex_3_44) ((_ extract 30 23) v_skolemized_v_prenex_3_44) ((_ extract 22 0) v_skolemized_v_prenex_3_44)))) (not (fp.eq (let ((.cse1 (select .cse2 .cse3))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse4)) (not (= ((_ to_fp 11 53) c_currentRoundingMode .cse0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_127|)))) (fp.eq (let ((.cse5 (let ((.cse6 (select .cse8 |c_~#double_Array_0~0.base|))) (concat (select .cse6 .cse7) (select .cse6 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) c_currentRoundingMode .cse4))))))))) is different from false [2024-11-14 00:03:02,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_3_44 (_ BitVec 32)) (v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (|v_skolemized_q#valueAsBitvector_127| (_ BitVec 64)) (v_ArrVal_1175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_1175))) (let ((.cse14 (store .cse12 |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1176))) (let ((.cse7 (bvadd (_ bv4 32) |c_~#double_Array_0~0.offset|)) (.cse10 (select .cse14 |c_~#float_Array_0~0.base|)) (.cse2 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|))) (let ((.cse8 (store (store (let ((.cse13 (store .cse10 .cse2 v_skolemized_v_prenex_3_44))) (store (store .cse12 |c_~#float_Array_0~0.base| .cse13) |c_~#double_Array_0~0.base| (store (store (select (store .cse14 |c_~#float_Array_0~0.base| .cse13) |c_~#double_Array_0~0.base|) |c_~#double_Array_0~0.offset| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_127|)) .cse7 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_127|)))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_1177) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_1181))) (let ((.cse1 (select .cse8 |c_~#float_Array_0~0.base|))) (let ((.cse3 (let ((.cse11 (select .cse1 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse4 (let ((.cse9 (select .cse10 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (or (not (fp.eq (let ((.cse0 (select .cse1 .cse2))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) .cse3)) (not (= ((_ to_fp 11 53) c_currentRoundingMode .cse4) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_127|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_127|)))) (fp.eq (let ((.cse5 (let ((.cse6 (select .cse8 |c_~#double_Array_0~0.base|))) (concat (select .cse6 .cse7) (select .cse6 |c_~#double_Array_0~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) c_currentRoundingMode .cse3)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_3_44) ((_ extract 30 23) v_skolemized_v_prenex_3_44) ((_ extract 22 0) v_skolemized_v_prenex_3_44)) .cse4)))))))))) is different from false [2024-11-14 00:03:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [935365285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 00:03:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629963779] [2024-11-14 00:03:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 00:03:10,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 00:03:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 00:03:10,604 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 00:03:10,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1281dd02-ead9-4c7c-a3d2-1eb3e98226d1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 00:03:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 00:03:27,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 00:03:27,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 00:03:34,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 81 [2024-11-14 00:03:34,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2024-11-14 00:03:35,331 INFO L224 Elim1Store]: Index analysis took 306 ms [2024-11-14 00:03:35,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2024-11-14 00:03:35,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 58 [2024-11-14 00:03:35,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 81 [2024-11-14 00:03:39,392 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 101 treesize of output 81 [2024-11-14 00:03:59,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 00:03:59,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 275 treesize of output 109 [2024-11-14 00:04:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-14 00:04:00,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 00:04:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629963779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 00:04:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 00:04:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 18] total 34 [2024-11-14 00:04:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528971573] [2024-11-14 00:04:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 00:04:00,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 00:04:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 00:04:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 00:04:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1281, Unknown=8, NotChecked=648, Total=2162 [2024-11-14 00:04:00,553 INFO L87 Difference]: Start difference. First operand 1066 states and 1318 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)